1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
class Solution:
def maxOperations(self, nums: List[int], k: int) -> int:
ans=0
nums.sort()
start=0
end=len(nums)-1
while end>start :
if nums[end] + nums[start] > k :
end-=1
elif nums[end] + nums[start] < k :
start +=1
else :
ans+=1
end -= 1
start += 1
return ans
|
cs |
전형적인 투 포인터 문제죠
반응형
'python-algorithm' 카테고리의 다른 글
leetcode 47. Permutations II (0) | 2022.05.12 |
---|---|
codeforces 1030A - In Search of an Easy Problem (0) | 2022.05.11 |
leetcode 844. Backspace String Compare (0) | 2022.05.02 |
leetcode 905. Sort Array By Parity (0) | 2022.05.02 |
codeforces 1352A - Sum of Round Numbers (0) | 2022.05.02 |
댓글