首页 > 代码库 > [LeetCode] Remove Duplicates from Sorted List
[LeetCode] 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.
思路一：
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 == NULL) return NULL;13 14 for (ListNode *prev = head; prev->next != NULL;) {15 ListNode *q = prev->next;16 if (prev->val == q->val) {17 prev->next = q->next;18 delete q;19 } else {20 prev = prev->next;21 }22 }23 24 return head;25 }26 };
思路二：纯粹是练习二级指针的用法，和第一种没有太大区别
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 == NULL || head->next ==NULL) return head;13 14 for (ListNode **curr = &head; (*curr)->next != NULL; ) {15 ListNode *q = (*curr)->next;16 if ((*curr)->val == q->val) {17 (*curr)->next = q->next;18 delete q;19 } else {20 curr = &((*curr)->next);21 }22 }23 24 return head;25 }26 };
[LeetCode] Remove Duplicates from Sorted List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。