题解 | #删除有序链表中重复的元素-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 *slow,* fast;
        slow = head;
        fast = head->next;
        while(fast)
        {
            if(fast->val==slow->val)
            {
                slow->next=fast->next;
                free(fast);
                fast = slow->next;
            }
            else 
            {
                fast = fast->next;
                slow = slow->next;            
            }
        }
        return head;
    }
};