interview question - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Java - 爪哇娇娃

interview question

interview question# Java - 爪哇娇娃

r*o2008-11-02 07:11

1 楼

精华区找不到了
H & J Auto Repair
7511 Chapman Ave
Garden Grove, CA 92841
Phone: (714) 890-1336
老板人很实在，好像是最早期出来留学的那波人，不过后来自己开铺子修车了。价钱不
是死便宜的那种，但是绝对不会玩花样坑你。俺老汉以前车子坏了再那修要过夜等配件
，老板就把他的lexus借给俺开回家了，做人很厚到。
如果是周六去的话要趁早，他那儿生意太好了。

m*a2008-11-02 07:11

2 楼

there are 2 integer arrays a and b ;
how do find the intersection of these two arrays and keep the order of array
a?
Has any one posted this question before?

s*y2008-11-02 07:11

3 楼

Build a HashMap using b,
Loop through a, check if element is in the HashMap

m*a2008-11-02 07:11

4 楼

Thanks. then how do you handle the repeat of elements?
say; A { 1,5, 5, 8 , 7,6,5}
B: {2, 3, 5, 5, 9,22,7}

g*g2008-11-02 07:11

5 楼

Use hashset

【在 m*****a 的大作中提到】

: Thanks. then how do you handle the repeat of elements?
: say; A { 1,5, 5, 8 , 7,6,5}
: B: {2, 3, 5, 5, 9,22,7}

Z*e2008-11-02 07:11

6 楼

when you build HashMap with B, let the key be elements in B, value be its
number of duplications
when you scan A, reduce the number of duplication in map when you find a
match and remove it from HashMap when it's zero

【在 m*****a 的大作中提到】

: Thanks. then how do you handle the repeat of elements?
: say; A { 1,5, 5, 8 , 7,6,5}
: B: {2, 3, 5, 5, 9,22,7}

m*a2008-11-02 07:11

7 楼

thanks, all.