python interview questions - Murray-LIANG/forgetful GitHub Wiki
def f(x,l=[]):
for i in range(x):
l.append(i*i)
print l
f(2)
f(3,[3,2,1])
f(3)lst = [random.random() for _ in range(10000)]
def f1(lst):
l1 = sorted(lst)
l2 = [i for i in l1 if i<0.5]
return [i*i for i in l2]
def f2(lst):
l1 = [i for i in lst if i<0.5]
l2 = sorted(l1)
return [i*i for i in l2]
def f3(lst):
l1 = [i*i for i in lst]
l2 = sorted(l1)
return [i for i in l1 if i<(0.5*0.5)]Eventloop, Coroutine, Task, Future.
给定一个list，里面全是数字，找出两个数和等于指定的数，返回这两个数在list中的index。
hints:
-
Brute force
-
Two-pass hash table
-
One-pass hash table
给定一个list，里面全是数字，找出三个数的和等于0，返回这三个数在list中的index。
hint:
- Sort
public List<List<Integer>> threeSum(int[] num) {
Arrays.sort(num);
List<List<Integer>> res = new LinkedList<>();
for (int i = 0; i < num.length-2; i++) {
if (i == 0 || (i > 0 && num[i] != num[i-1])) {
int lo = i+1, hi = num.length-1, sum = 0 - num[i];
while (lo < hi) {
if (num[lo] + num[hi] == sum) {
res.add(Arrays.asList(num[i], num[lo], num[hi]));
while (lo < hi && num[lo] == num[lo+1]) lo++;
while (lo < hi && num[hi] == num[hi-1]) hi--;
lo++; hi--;
} else if (num[lo] + num[hi] < sum) lo++;
else hi--;
}
}
}
return res;
}