首页 > 代码库 > [leetcode] Remove Duplicates from Sorted List II
[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.
https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
思路：需要一个dummy head辅助。
public class Solution { public ListNode deleteDuplicates(ListNode head) { ListNode newHead = new ListNode(-1); newHead.next = head; ListNode pre = newHead; ListNode cur = head; while (cur != null && cur.next != null) { if (cur.val == cur.next.val) { while (cur != null && cur.next != null && cur.val == cur.next.val) { cur = cur.next; } cur = cur.next; pre.next = cur; } else { pre = cur; cur = cur.next; } } return newHead.next; } public static void main(String[] args) { ListNode head = ListUtils.makeList(1, 1, 2, 3, 3); ListUtils.printList(head); head = new Solution().deleteDuplicates(head); ListUtils.printList(head); }}
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。