We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b90ab99 commit af913cbCopy full SHA for af913cb
programmers/Lv.1/max_training_cloth.py
@@ -1,13 +1,9 @@
1
def solution(n, lost, reserve):
2
- count = 0
3
- for num in lost:
4
- if num in reserve:
5
- reserve.remove(num)
6
- count += 1
7
- elif num - 1 in reserve:
8
- reserve.remove(num - 1)
9
10
- elif num + 1 in reserve:
11
- reserve.remove(num + 1)
12
13
- return n - len(lost) + count
+ set_reserve = set(reserve) - set(lost)
+ set_lost = set(lost) - set(reserve)
+ for num in set_reserve:
+ if num - 1 in set_lost:
+ set_lost.remove(num - 1)
+ elif num + 1 in set_lost:
+ set_lost.remove(num + 1)
+ return n - len(set_lost)
0 commit comments