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

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    ListNode* deleteDuplicates(ListNode* head) {
        // write code here
        if(head == nullptr || head->next == nullptr) return head;
        ListNode* ans = head;
        ListNode* cur = ans->next;
        while(head && cur)
        {
            if(head->val == cur->val)
            {
                cur = cur->next;
                head->next = cur;
            }
            else
            {
                head = head->next;
                cur = cur->next;
            }
        }
        return ans;
    }
};