-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.py
79 lines (66 loc) · 1.28 KB
/
test.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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
def f(x, t):
l = 0
r = len(x) - 1
while (l <= r):
mid = (l + r) // 2 # vardbg: ref x[mid]
print(x[mid])
if x[mid] < min(x):
continue
if x[mid] > t:
r = mid - 1 # vardbg: ref x[r]
else:
l = mid + 1 # vardbg: ref x[l]
if x[mid] < min(x):
continue
return r
def f2(arr):
n = len(arr)
for i in range(n):
for j in range(n):
if i == j:
break
print(i, j)
if i < j:
print(i, j)
break
print("Got here")
def f3():
if a:
if b:
print("0")
elif c == d:
print("1")
else:
print(2)
elif b == a:
print("3")
else:
print(5)
def f4(x):
print(x)
for i in range(len(x)):
if i == 0:
print("1")
# def f1(a):
# if a:
# if a+1:
# print("1")
# else:
# print("2")
# else:
# print("4")
# def foo():
# i = 0
# while True:
# i += 1
# break
# for j in range(3):
# i += j
# break
# return i
def main():
l = 1
f([1, 3, 4, 5, 6, 10, 11], 6)
f4([1, 2, 3])
if __name__ == "__main__":
main()