LeetCode83 Remove Duplicates from Sorted List

题目:

       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 RemoveDuplicatesSortedList {
    public static class ListNode {
        int val;
        ListNode next;
        ListNode(int x) { val = x; }
    }

    public static ListNode deleteDuplicates(ListNode head) {
        if (head == null || head.next == null)
            return head;

        ListNode left = head;
        ListNode right = head.next;
        while (right != null){
            while(right != null && right.val == left.val){
                right = right.next;
            }
            left.next = right;
            left = left.next;
        }

        return head;
    }


    public static ListNode createLinkedList(int arr[], int n){
        if (n == 0)
            return null;
        ListNode head = new ListNode(arr[0]);
        ListNode cur = head;
        for (int i = 1; i < n; i++) {
            cur.next = new ListNode(arr[i]);
            cur = cur.next;
        }

        return head;
    }

    public static void printLinkedList(ListNode head){
        ListNode cur = head;
        while (cur != null){
            System.out.print(cur.val + " -> ");
            cur = cur.next;
        }
        System.out.println("NULL");
    }

    public static void main(String[] args) {
        int[] arr = {1, 1, 2, 3, 3};
        ListNode head = createLinkedList(arr, arr.length);
        printLinkedList(head);
        ListNode node = deleteDuplicates(head);
        printLinkedList(node);
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值