//给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
//
// 示例 1:
//
// 输入: 1->1->2
//输出: 1->2
//
//
// 示例 2:
//
// 输入: 1->1->2->3->3
//输出: 1->2->3
// Related Topics 链表
// 👍 478 👎 0
/*
* 83 删除排序链表中的重复元素
* 2021-02-26 20:33:53
* @author oxygenbytes
*/
#include "leetcode.h"
//leetcode submit region begin(Prohibit modification and deletion)
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
auto cur = head;
while(cur){
if(cur->next && cur->val == cur->next->val){
cur->next = cur->next->next;
}else cur = cur->next;
}
return head;
}
};
//leetcode submit region end(Prohibit modification and deletion)