Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

An interview problem I encountered years ago.. 1AC

class Solution 
{
public:
    void deleteNode(ListNode* node) 
    {
        if(!node) return;
        ListNode *p1 = node;
        ListNode *p2 = node->next;
        while(p1 && p2)
        {
            p1->val = p2->val;
            if(!p2->next)
            {
                p1->next = nullptr;
                return;
            }
            p1 = p2;
            p2 = p2->next;
        }
    }
};
posted on 2015-07-15 09:10  Tonix  阅读(135)  评论(0编辑  收藏  举报