题解 | #删除有序链表中重复的元素-I#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    ListNode* deleteDuplicates(ListNode* head) {
        // write code here
        if(!head || !head->next)
            return head;
        ListNode* pre = head;
        ListNode* curr = head->next;
        while(curr)
        {
            if(curr->val == pre->val)
            {
                pre->next = curr->next;
                curr = pre->next;
            }
            else
            {
                curr = curr->next;
                pre = pre->next;
            }
        }
        return head;
    }
};