首页 > 代码库 > [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.
/** * 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) { ListNode *p = NULL,*q; if(head == NULL || head->next == NULL) return head; p = head; while(p!=NULL && p->next !=NULL){ if(p->next->val == p->val){ q = p->next->next; //Delete p->next; //不需要的指针不删除吗？提示‘Delete‘ was not declared in this scope p->next = q; }else{ p = p->next; }//end if }//end while return head; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。