题解 | #删除有序链表中重复的元素-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) {
        if (!head) {
            return nullptr;
        }
        ListNode *slow = head;
        ListNode *fast = head->next;
        ListNode *newhead = new ListNode(slow->val);
        ListNode *begin = newhead;
        if (!fast) {
            return head;
        }
        while (fast) {
            if (slow->val!=fast->val) {
                slow->next = fast;
                slow = fast;
                begin->next = new ListNode(fast->val);
                begin = begin->next;
            }
            fast = fast->next;
        }
        return newhead;
        // write code here
    }
};