题目:
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
解题思路:设置两个指针CurrList和NewList,初始化为同一头指针,CurrList不断向链表尾部扫描,如果当前节点的值不是重复值,就将该节点接到NewList尾部。
代码:
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *deleteDuplicates(ListNode *head) { if(head==NULL){ return NULL; } int temp=head->val; ListNode *CurrList=head; ListNode *NewList=head; while(CurrList->next){ CurrList=CurrList->next; if(CurrList->val!=temp){ NewList->next=CurrList; NewList=NewList->next; temp=CurrList->val; } } NewList->next=CurrList->next; return head; } };