首页 > 代码库 > LeetCode 83. Remove Duplicates from Sorted List
LeetCode 83. 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.
Subscribe to see which companies asked this question
这是个没有头结点的链表，我们只要将重复的删掉即可（因为链表是排好序的，我们只要判断后者的值是否等于前者，如果等于则删掉）
/** * 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) { if (!head)return head; ListNode *pre = head, *current = pre->next; while (current) { if (current->val == pre->val) { pre->next = current->next; free(current); current = pre->next; } else { current = current->next; pre = pre->next; } } return head; }};
LeetCode 83. Remove Duplicates from Sorted List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。