83. Remove Duplicates from Sorted List

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

**Example 1:**

1
2
Input: 1->1->2
Output: 1->2
**Example 2:**
1
2
Input: 1->1->2->3->3
Output: 1->2->3
思路:简单的判断链表是否重复,并删除重复节点。考察的是链表的遍历与删除。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
* 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) return head;

ListNode *cur = head;

while (cur->next) {
if (cur->val == cur->next->val) {
ListNode *temp = cur->next;
cur->next = temp->next;
} else {
cur = cur->next;
}
}
return head;
}
};
Res. Runtime: 8ms, Ranking 99.94%