Today is a gift!

 

Tencent Intern Interview

?地址运算:

int a[] = {1,2,3,4,5,6,7,8,9};

 short *p = (short *)(a + 2);
 short *q = (short *)a;

 a[p -q] ?

?求两个集合的交集(两个集合 要排序):

 

?求26个英文字母的所有子集

 

? 单链表逆转

 

?new 和malloc, delete和free的区别

 

 

posted on 2011-04-29 15:31  Biao Wang  阅读(137)  评论(0)    收藏  举报

导航