Solve problem 265
This commit is contained in:
@@ -39,8 +39,6 @@ def get_maximix_arrangements(n: int) -> list:
|
||||
max_xs = []
|
||||
max_xs_count = 0
|
||||
for x in xs:
|
||||
if x[0] == 0 or x[-1] == 0:
|
||||
continue
|
||||
c = count(x)
|
||||
if c == max_xs_count:
|
||||
max_xs.append(x)
|
||||
|
||||
Reference in New Issue
Block a user