首页 > 代码库 > LeetCode 83 Remove Duplicates from Sorted List
LeetCode 83 Remove Duplicates from Sorted List
Problem:
Given a sorted linked list, delete all duplicates such that each element appears only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
.
Summary:
删除链表中的重复元素。
Analysis:
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) { 13 return head; 14 } 15 16 ListNode *tmp = head; 17 while (tmp->next != NULL) { 18 ListNode *p = tmp->next; 19 if (tmp->val == p->val) { 20 tmp->next = p->next; 21 delete p; 22 } 23 else { 24 tmp = tmp->next; 25 } 26 } 27 28 return head; 29 } 30 };
LeetCode 83 Remove Duplicates from Sorted List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。