首页 > 代码库 > 【LeetCode】Remove Duplicates from Sorted List
【LeetCode】Remove Duplicates from Sorted List
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 == NULL || head->next == NULL) return head; ListNode* pre = head; ListNode* cur = head->next; while(cur != NULL) { if(cur->val == pre->val) { pre->next = cur->next; cur = cur->next; } else { pre = cur; cur = cur->next; } } return head; }};
【LeetCode】Remove Duplicates from Sorted List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。