美国的结婚证 回国签F2 必须要公证再拿到大使馆认证吗？# Reunion - 探亲与陪读
k*e
1 楼
以下两个题目，都十分繁琐
1） given a sorted array, then rotate at certain place and move those
numbers to the left begining. i.e, 12345, rotate at 3, we will get 34512,
output where is the rotation place.
require: handle all extreme cases. for example, 1 million 0 and the other
number is 2.
2) given an int less than 1 billion, output its english representation. then
1231 would be one thousand and thirty one.
the problem is: we have to be very careful about the placement of "and". if
1000, then just one thous
1） given a sorted array, then rotate at certain place and move those
numbers to the left begining. i.e, 12345, rotate at 3, we will get 34512,
output where is the rotation place.
require: handle all extreme cases. for example, 1 million 0 and the other
number is 2.
2) given an int less than 1 billion, output its english representation. then
1231 would be one thousand and thirty one.
the problem is: we have to be very careful about the placement of "and". if
1000, then just one thous
