LeetCode | 83. 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) {        if(head == NULL || head->next == NULL)            return head;        ListNode *p = head, *q = head->next, *cur;        while(q != NULL)        {            cur = q->next;            if(p->val == q->val)            {                p->next = q->next;                delete q;            }            else            {                p = q;            }            q = cur;        }        return head;    }};

一次AC^_______________________^