【leetcode刷题笔记】Remove Duplicates from Sorted List

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.

---

题解：水题不解释

 /**
  * 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) {
         ListNode *p = head;
         while(p != NULL){
             while(p->next != NULL && p->next->val == p->val){
                 ListNode* temp = p->next;
                 p->next = p->next->next;
                 delete(temp);
             }
             if(p!=NULL)
                 p = p->next;
         }
         return head;
     }
 };

Java版本：

 /**
  * Definition for singly-linked list.
  * public class ListNode {
  *     int val;
  *     ListNode next;
  *     ListNode(int x) {
  *         val = x;
  *         next = null;
  *     }
  * }
  */
 public class Solution {
     public ListNode deleteDuplicates(ListNode head) {
         if(head == null)
             return head;
         ListNode current = head;
         ListNode next = current.next;
         while(next != null){
             if(current.val == next.val){
                 //删除next指向的节点
                 current.next = next.next;
                 next = current.next;
             }else {
                 current = next;
             }
         }
         return head;
     }
 }