【Leetcode】Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.
For example, Given  1->1->2 , return  1->2 . Given  1->1->2->3->3 , return  1->2->3 .
分析:ついでに遍歴すればいいです.後の要素が前の要素と同じ場合は削除します.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if(head == nullptr)
            return nullptr;
        
        ListNode *ori = head;
        ListNode *next_node = head->next;
        ListNode *del;
        
        while(next_node)
        {
            if(next_node->val != ori->val)
            {
                ori = next_node;
                next_node = next_node->next;
            } else
            {
                del = next_node;
                ori->next = next_node->next;
                next_node = next_node->next;
                delete del;
            }
            
        }
        
        return head;
    }
};