首页 > 代码库 > 【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 ListNode *p = head; 13 while(p != NULL){ 14 while(p->next != NULL && p->next->val == p->val){ 15 ListNode* temp = p->next; 16 p->next = p->next->next; 17 delete(temp); 18 } 19 if(p!=NULL) 20 p = p->next; 21 } 22 return head; 23 } 24 };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。