Leetcode:Delete DUplicates From Sorted List(java)

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;
        }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值