https://leetcode.com/problems/remove-duplicates-from-sorted-list/

Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

Input: 1->1->2
Output: 1->2

Example 2:

Input: 1->1->2->3->3
Output: 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 || !head -> next) return head;
        
        ListNode *start = head;
        while(start && start -> next) {
            if(start -> val == start -> next -> val) {
                ListNode *cur = start -> next;
                start -> next = start -> next -> next;
                free(cur);
            }
            else 
                start = start -> next;
        }
        return head;
        
    }
};

　　本來想著自己嘗試寫出來但是很遺憾 錯的跟什麼一樣 只能看看題解但是還是有的地方很煩看的不懂 今天是傷心又難過的小可憐