-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdiffPossible.py
More file actions
56 lines (39 loc) · 759 Bytes
/
Copy pathdiffPossible.py
File metadata and controls
56 lines (39 loc) · 759 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
43
44
45
46
47
48
49
50
51
52
53
54
# Codelab Facebook
class Solution:
# @param A : list of integers
# @param B : integer
# @return an integer
def diffPossible(self, A, B):
size = len(A)
if A < 1:
return 0
diff = 0
i = 0
j = i + 1
# diff = A[j] - A[i]
# if B > diff:
# return 0
while i < size - 1 and j < size:
diff = A[j] - A[i]
if diff == B and i < j:
return 1
if i == j or diff < B:
j += 1
elif diff > B:
i += 1
return 0
# while i < j:
# diff = A[j] - A[i]
# print diff, i, j
# if diff == B:
# return 1
# if i+1 < j:
# d2 = A[j-1] - A[i]
# d1 = A[j] - A[i+1]
# if d1 >= B and d1 < d2:
# i += 1
# else:
# j -= 1
# else:
# break
# return 0