题解 | #删除有序链表中重复的元素-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 == nullptr || head->next == nullptr)return head;
        auto dummy = new ListNode(0);
        dummy->next = head;
        ListNode* f = head;
        ListNode* s = head;
        while(f != nullptr){
            if(f->val == s->val){
                f = f->next;
            }
            else if(f->val != s->val){
                s->next = f;
                s = s->next;
            }
        }
        s->next = nullptr;
        return dummy->next;
    }
};