请问485,most recent employment outside the U.S.可不可以不# EB23 - 劳工卡
w*j
1 楼
f:
written test before interview:
Code:
public int bar(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 0)
return bar(a, b / 2) * bar(a, b / 2);
return bar(a, b - 1) * a;
}
Questions:
1. bar 是什么?
2. big O in terms of a and b
3. list 2 - 3 changes you would make to the above fucntion, and reweite code
phone
1. array intersection
2. start from # , can only move to the upleft/up/upright cell from each
position, return the max value you could get traversing thru the matrix
W
=================
|0|5|0|5|0|1|0|4|
|0|0|0|2|0|0|0|0|
|0|1|0|0|2|2|0|1|
|0|0|0|0|2|0|0|1|
|9|0|0|0|2|7|0|0| H
|9|0|9|0|0|0|0|0|
|9|0|0|5|0|0|0|0|
|9|0|0|#|0|0|0|0|
written test before interview:
Code:
public int bar(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 0)
return bar(a, b / 2) * bar(a, b / 2);
return bar(a, b - 1) * a;
}
Questions:
1. bar 是什么?
2. big O in terms of a and b
3. list 2 - 3 changes you would make to the above fucntion, and reweite code
phone
1. array intersection
2. start from # , can only move to the upleft/up/upright cell from each
position, return the max value you could get traversing thru the matrix
W
=================
|0|5|0|5|0|1|0|4|
|0|0|0|2|0|0|0|0|
|0|1|0|0|2|2|0|1|
|0|0|0|0|2|0|0|1|
|9|0|0|0|2|7|0|0| H
|9|0|9|0|0|0|0|0|
|9|0|0|5|0|0|0|0|
|9|0|0|#|0|0|0|0|