Remove Duplicates from Sorted List (Easy)

##Description

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.

Analysis

删除有序链表中的重复元素。模拟即可

My Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
//C++
/**
 * 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||head->next==NULL)
            return head;
        ListNode *p = head,*nxt = p->next;
        while(nxt!=NULL){
            if(p->val==nxt->val){
                p->next = nxt->next;
                free(nxt);
                nxt = p->next;
            }
            else{
                p = nxt;
                nxt = p->next;
            }
        }
        return head;
    }
};