首页 > itarticle > leetcode 83. remove duplicates from sorted list

leetcode 83. remove duplicates from sorted list

admin 11月 12, 2020 0

算法
Java
Leetcode

Question

Given a sorted linked list, delete all duplicates such that each element appear only once.
See it on Leetcode

1
2
3

For example,
Given "1->1->2", return "1->2".
Given "1->1->2->3->3", return "1->2->3".

Hint

This is a simple problem that merely tests your ability to manipulate list node pointers. Because the input list is sorted, we can determine if a node is a duplicate by comparing its value to the node after it in the list. If it is a duplicate, we change the next pointer of the current node so that it skips the next node and points directly to the one after the next node.

Solution

java
cpp


 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class  {
    public ListNode deleteDuplicates(ListNode head) {
        ListNode current = head;
        while (current != null && current.next != null) {
            if (current.next.val == current.val) {
                current.next = current.next.next;
            } else {
                current = current.next;
            }
        }
        return head;
    }
}