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.

pro：从排序链表中删除重复的节点

sol：定义cur和next指针，遍历链表，next不为NULL的时候继续遍历，当next的value与cur的value相等时，将next删除

code：

/** * 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;        ListNode *cur,*next;        cur=head;        next=cur->next;        while(next!=NULL)        {            if(next->val==cur->val)            {                cur->next=next->next;                //cur=next;                next=next->next;            }else            {                cur=next;                next=next->next;            }        }        return head;    }};