LeetCode:Remove Duplicates from Sorted List I II

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.

分析：和从数组中移除重复元素那一题一样的思想

/*** 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) {// IMPORTANT: Please reset any member data you declared, as// the same Solution instance will be reused for each test case.if(head == NULL || head->next == NULL)return head;ListNode *index = head, *p = head->next, *pre = head;while(p != NULL){if(p->val != pre->val){index = index->next;index->val = p->val;}pre = p;p = p->next;}p = index->next;index->next = NULL;while(p != NULL){//销毁多余的节点ListNode *tmp = p;p = p->next;delete tmp;}return head;}
};

LeetCode:Remove Duplicates from Sorted List II

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 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) {// IMPORTANT: Please reset any member data you declared, as// the same Solution instance will be reused for each test case.if(head == NULL)return head;//为操作方便添加头结点ListNode *addHead = new ListNode(0);addHead->next = head;//index 指向已经保存的最后一个节点ListNode *index = addHead, *p = head;while(p != NULL){if(p->next == NULL || p->val != p->next->val){//当前节点没有重复index = index->next;index->val = p->val;p = p->next;}else{//当前节点有重复，找到当前节点的最后一个副本的下一个元素while(p->next && p->val == p->next->val)p = p->next;p = p->next;}}p = index->next;index->next = NULL;while(p != NULL){//销毁多余的节点ListNode *tmp = p;p = p->next;delete tmp;}head = addHead->next;delete addHead;return head;}
};

转载于:https://www.cnblogs.com/TenosDoIt/p/3461481.html

LeetCode:Remove Duplicates from Sorted List I II相关推荐

Leetcode OJ: Remove Duplicates from Sorted Array I/II
删除排序数组重复元素,先来个简单的. Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates i ...
[Leetcode] Remove duplicates from sorted array ii 从已排序的数组中删除重复元素
Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For examp ...
[LeetCode] Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For examp ...
LeetCode Remove Duplicates from Sorted List II
题意:给出一个单链表 ,将其中重复的元素删除思路:在找重复结点时,需要找到其前继结点代码如下: class Solution {public ListNode deleteDuplicates(L ...
LeetCode() Remove duplicates from sorted list II
ListNode* dummy = new ListNode(0); //必须要加上 new ListNode(0); 否则有错误. dummy->next = head; head = dum ...
LeetCode Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once. For examp ...
[LeetCode] Remove Duplicates from Sorted List - 链表问题
题目概述: Given a sorted linked list, delete all duplicates such that each element appear only once. For ...
Remove Duplicates from Sorted Array II -- LeetCode
原题链接: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/ 这道题跟Remove Duplicates ...
LeetCode 80. Remove Duplicates from Sorted Array II
80. Remove Duplicates from Sorted Array II My Submissions QuestionEditorial Solution Total Accepted: ...

LeetCode:Remove Duplicates from Sorted List I II

LeetCode:Remove Duplicates from Sorted List I II相关推荐

最新文章

热门文章