This topic has been archived. It cannot be replied.
-
工作学习 / 学科技术讨论 / 微软的面试题， 哪位大侠给说说思路？• Can you write the code which finds the middle element in a list? Implement code in C/C++
• Can you delete an element from the middle of single linked list without knowing the head and the tail of the list? Implement code in C/C++
• Can you explain me what is a handle (OS / platform question)?
• Can you tell me how to compare two COM objects for equality (not semantic equality, but whether they point to the same object in memory)?
-tonyhao(tonyhao);
2007-9-21
{494}
(#3947286@0)
-
找本数据结构读读。这些基本问题不会，进去也不好混。
-robin_ma(Nick Name);
2007-9-21
(#3947291@0)
-
微软刚给$40/h, 肯定好混。
-tonyhao(tonyhao);
2007-9-21
(#3947298@0)
-
他们的工资就是不高。
-robin_ma(Nick Name);
2007-9-21
(#3947301@0)
-
另外是Tester职位吗？
-robin_ma(Nick Name);
2007-9-21
(#3947302@0)
-
Tester of 90k?
-liquid(avaya);
2007-9-21
(#3947331@0)
-
他给我100k我都没去
-robin_ma(Nick Name);
2007-9-21
(#3947619@0)
-
How did you get the chance of interview? Those are very basic question, I wish I were there. LOL
-mteverest(Everest);
2007-9-21
(#3947649@0)
-
1) 答案见内。 2)这一题不理解，没有头结点，那么怎么找到这个单链表啊（且不用说删除结点了）ASSERT(pHead != null)
item* pointerA = pHead;
item* pointerB = pHead;
while (pointerA ->Next != null && pointerA ->Next->Next != null)
{
pointerA = pointerA->Next->Next;
pointerB = pointerB->Next;
}
-carolhu(晒太阳的大花猫);
2007-9-21
{205}
(#3947869@0)
-
这是个老掉牙的考题，方法是把下一个节点的内容按位拷贝到当前节点，然后将下一个节点删除。这样整个链表仍然保持完整。偶觉得强词夺理，不过不知道其他的办法。
-liquid(avaya);
2007-9-21
(#3947959@0)
-
o, 这样啊，确实比较tricky
-carolhu(晒太阳的大花猫);
2007-9-22
(#3949147@0)
-
真正面试的时候, 题目类型相当, 但一般30分钟内要搞定.
-tonyhao(tonyhao);
2007-9-22
(#3948343@0)