Skip to content

Commit 4c8d15b

Browse files
[pre-commit.ci] auto fixes from pre-commit.com hooks
for more information, see https://pre-commit.ci
1 parent 95c48b0 commit 4c8d15b

2 files changed

Lines changed: 14 additions & 20 deletions

File tree

bit_manipulation/max_xor_bit_trie.py

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -12,10 +12,9 @@
1212
"""
1313

1414

15-
16-
1715
class TrieNode:
1816
"""Node of the Bitwise Trie."""
17+
1918
def __init__(self) -> None:
2019
self.child = [None, None] # child[0] for bit 0, child[1] for bit 1
2120

@@ -55,7 +54,7 @@ def query_max_xor(self, num: int) -> int:
5554
bit = (num >> i) & 1
5655
toggle = 1 - bit
5756
if node.child[toggle]:
58-
max_xor |= (1 << i)
57+
max_xor |= 1 << i
5958
node = node.child[toggle]
6059
else:
6160
node = node.child[bit]

bit_manipulation/sliding_window_xor.py

Lines changed: 12 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -17,16 +17,16 @@
1717

1818
class SlidingWindowXOR:
1919
"""
20-
Use:
21-
solver = SlidingWindowXOR()
22-
result = solver.compute(
23-
array_length,
24-
window_size,
25-
first_element,
26-
multiplier,
27-
increment,
28-
modulo
29-
)
20+
Use:
21+
solver = SlidingWindowXOR()
22+
result = solver.compute(
23+
array_length,
24+
window_size,
25+
first_element,
26+
multiplier,
27+
increment,
28+
modulo
29+
)
3030
3131
"""
3232

@@ -90,15 +90,10 @@ def compute(
9090
multiplier,
9191
increment,
9292
modulo,
93-
expected
93+
expected,
9494
) = test_case
9595
result = solver.compute(
96-
array_length,
97-
window_size,
98-
first_element,
99-
multiplier,
100-
increment,
101-
modulo
96+
array_length, window_size, first_element, multiplier, increment, modulo
10297
)
10398
print(f"Testcase {idx}: Expected={expected}, Got={result}")
10499
assert result == expected, f"Testcase {idx} failed!"

0 commit comments

Comments
 (0)