[LeetCode]--83. Remove Duplicates from Sorted List

这里写图片描述

Firstly, see my ugly code!

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if (head == null) return null;
        ListNode curr = head;
        while (curr != null && curr.next != null){
            if (curr.val == curr.next.val && curr.next.next != null) {
                curr.next = curr.next.next;
                // the 'continue' solve the problem that "11111" etc.
                continue;
            }
            else if (curr.val == curr.next.val && curr.next.next == null) {
                curr.next = null;
            }
            curr = curr.next;
        }
        return head;
    }
}

Recursive Solution(Excellent idea)\

public ListNode deleteDuplicates(ListNode head) {
        if(head == null || head.next == null)return head;
        head.next = deleteDuplicates(head.next);
        return head.val == head.next.val ? head.next : head;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值