LeetCode – Refresh – Remove Duplicates from Sorted List

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     ListNode *deleteDuplicates(ListNode *head) {
12         if (!head || !head->next) return head;
13         ListNode *runner = head;
14         while (runner->next) {
15             if (runner->val == runner->next->val) {
16                 runner->next = runner->next->next;
17                 continue;
18             }
19             runner = runner->next;
20         }
21         return head;
22     }
23 };