-
Notifications
You must be signed in to change notification settings - Fork 0
/
001.py
48 lines (45 loc) · 1.19 KB
/
001.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
a = [(i, nums[i]) for i in range(len(nums))]
a.sort(key=operator.itemgetter(1))
i = 0
j = len(nums)-1
while True:
if i==j:
print "should not happen"
break
sum = a[i][1]+a[j][1]
if sum==target:
break
elif sum<target:
i+=1
else:
j-=1
return sorted([a[i][0]+1, a[j][0]+1])
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
a = [(i, nums[i]) for i in range(len(nums))]
a.sort(key=operator.itemgetter(1))
i = 0
j = len(nums)-1
while True:
if i==j:
print "should not happen"
break
sum = a[i][1]+a[j][1]
if sum==target:
break
elif sum<target:
i+=1
else:
j-=1