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.

 

Hide Tags
 Linked List
 
class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if(head==NULL)  return NULL;
        ListNode *lp = head,*rp = head;
        while(rp!=NULL){
            while(rp!=NULL&&rp->val==lp->val)   rp=rp->next;
            lp->next = rp;
            lp = rp;
        }
        return head;
    }
};

 

相关文章:

  • 2022-01-17
  • 2021-12-07
  • 2022-12-23
  • 2021-05-22
  • 2021-12-02
  • 2022-12-23
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2021-08-09
  • 2021-06-13
  • 2021-11-17
  • 2021-09-19
  • 2021-06-02
相关资源
相似解决方案