Skip to content

Commit bda3d55

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

1 file changed

Lines changed: 13 additions & 3 deletions

File tree

bit_manipulation/sliding_window_xor.py

Lines changed: 13 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ def compute(
2727
first_element: int,
2828
multiplier: int,
2929
increment: int,
30-
modulo: int
30+
modulo: int,
3131
) -> int:
3232
"""
3333
Compute cumulative XOR of all sliding windows of size window_size.
@@ -72,8 +72,18 @@ def compute(
7272
(4, 4, 3, 1, 0, 10, 0),
7373
]
7474

75-
for idx, (array_length, window_size, first_element, multiplier, increment, modulo, expected) in enumerate(test_cases, 1):
76-
result = solver.compute(array_length, window_size, first_element, multiplier, increment, modulo)
75+
for idx, (
76+
array_length,
77+
window_size,
78+
first_element,
79+
multiplier,
80+
increment,
81+
modulo,
82+
expected,
83+
) in enumerate(test_cases, 1):
84+
result = solver.compute(
85+
array_length, window_size, first_element, multiplier, increment, modulo
86+
)
7787
print(f"Testcase {idx}: Expected={expected}, Got={result}")
7888
assert result == expected, f"Testcase {idx} failed!"
7989

0 commit comments

Comments
 (0)