package LeetCode_LinkedList; /** * 题目: * Given a sorted linked list, delete all duplicates such that each element appear only once. * Example 1: * Input: 1->1->2 * Output: 1->2 * Example 2: * Input: 1->1->2->3->3 * Output: 1->2->3 */ public class DeleteDuplicates_83_1012 { public ListNode DeleteDuplicates(ListNode head) { if (head == null) { return head; } ListNode result = new ListNode(-1); result.next = head; ListNode cur = head; while (cur != null && cur.next != null) { if (cur.val == cur.next.val) { cur.next = cur.next.next; } else cur = cur.next; } return result.next; } public static void main(String[] args) { ListNode node1 = new ListNode(1); ListNode node2 = new ListNode(1); ListNode node3 = new ListNode(2); ListNode node4 = new ListNode(3); ListNode node5 = new ListNode(3); node1.next = node2; node2.next = node3; node3.next = node4; node4.next = node5; DeleteDuplicates_83_1012 test = new DeleteDuplicates_83_1012(); ListNode result = test.DeleteDuplicates(node1); while (result != null) { System.out.println(result.val + " "); result = result.next; } } }
Leetcode:Delete DUplicates From Sorted List(java)
最新推荐文章于 2021-03-26 09:05:23 发布