[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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ListNode *p = head;
        ListNode *q = p;
        while (p) {
            q = p->next;
            if (q && (q->val == p->val)) {
                p->next = q->next;
                delete q;
            }
            else
                p = p->next;
        }
        return head;
    }
};

[源代码]

https://github.com/rangercyh/leetcode/blob/master/Remove%20Duplicates%20from%20Sorted%20List