[合集] google interview question# JobHunting - 待字闺中
h*g
1 楼
☆─────────────────────────────────────☆
oncerest (乌龙茶) 于 (Fri Sep 22 04:33:17 2006) 提到:
- implement a fixed size cache put and get methods. and Least Recently Used
discards
- 两个排序的数组, 找出交集.
☆─────────────────────────────────────☆
robertt (陈龙川) 于 (Fri Sep 22 04:46:20 2006) 提到:
For the second question, put two pointers in the beginning of the sorted arr
ay and scan by comparision. The running time is O(m+n) if the length of the
arrays are m and n respectively.
Used
oncerest (乌龙茶) 于 (Fri Sep 22 04:33:17 2006) 提到:
- implement a fixed size cache put and get methods. and Least Recently Used
discards
- 两个排序的数组, 找出交集.
☆─────────────────────────────────────☆
robertt (陈龙川) 于 (Fri Sep 22 04:46:20 2006) 提到:
For the second question, put two pointers in the beginning of the sorted arr
ay and scan by comparision. The running time is O(m+n) if the length of the
arrays are m and n respectively.
Used