1
2
3
4
5
6
7
|
class Solution:
def countKDifference(self, nums: List[int], k: int) -> int:
cnt=0
for i in range(len(nums)):
for j in range(i+1,len(nums)):
if abs (nums[i]-nums[j])==k: cnt+=1
return cnt
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
leetcode 1688. Count of Matches in Tournament (0) | 2022.03.07 |
---|---|
백준 9316 Hello Judge (0) | 2022.03.07 |
leetcode 2194. Cells in a Range on an Excel Sheet (0) | 2022.03.07 |
leetcode 2160. Minimum Sum of Four Digit Number After Splitting Digits (0) | 2022.03.07 |
leetcode 2114. Maximum Number of Words Found in Sentences (0) | 2022.03.07 |
댓글