Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 61db5d1

Browse files
committed
K-diff Pairs in an Array
1 parent 0350db5 commit 61db5d1

File tree

1 file changed

+35
-0
lines changed

1 file changed

+35
-0
lines changed
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
# Source : https://leetcode.com/problems/k-diff-pairs-in-an-array/?tab=Description
2+
# Author : Han Zichi
3+
# Date : 2017年03月06日
4+
5+
class Solution(object):
6+
def findPairs(self, nums, k):
7+
"""
8+
:type nums: List[int]
9+
:type k: int
10+
:rtype: int
11+
"""
12+
if k < 0:
13+
return 0
14+
15+
nums.sort()
16+
dict = {}
17+
18+
for item in nums:
19+
key = str(item)
20+
if key in dict:
21+
dict[key] += 1
22+
else:
23+
dict[key] = 1
24+
25+
pre, ans = None, 0
26+
for item in nums:
27+
if item == pre:
28+
continue
29+
dict[str(item)] -= 1
30+
target = item + k
31+
if str(target) in dict and dict[str(target)] > 0:
32+
ans += 1
33+
pre = item
34+
35+
return ans

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /