-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtwo_sum_ii.py
More file actions
42 lines (33 loc) · 858 Bytes
/
Copy pathtwo_sum_ii.py
File metadata and controls
42 lines (33 loc) · 858 Bytes
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
def twoSum(self, numbers, target):
for i in range(len(numbers)):
l, r = i+1, len(numbers)-1
tmp = target - numbers[i]
while l <= r:
mid = l + (r-l)//2
if numbers[mid] == tmp:
return [i+1, mid+1]
elif numbers[mid] < tmp:
l = mid+1
else:
r = mid-1
'''
https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
[1, 3, 5, 7, 8, 11, 17], target = 9 // answer = [2, 4]
for 0 in 7:
left = 1
right = 6
tmp = 9 - array[0] = 9 - 1 = 8
while 1 <= 6:
mid = 1 + 2 = 3
if 7 < 8 (tmp):
left = 4
---
while 4 <= 6:
mid = 4 + 1 = 5
if 11 > 8:
right = 4
while 4 <= 4:
mid = 4 + 0 = 4
8 == target:
return [1, 5]
'''