Leetcode-Remove Duplicates from Sorted List

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

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

Given 1->1->2->3->3, return 1->2->3.

AC代码:

public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if( head == null || head.next == null )
			return head;
		//delete duplicates or move on
		ListNode curr = head;
		ListNode next = curr.next;
		while( next != null ){
			ListNode temp = next.next;
			if( curr.val == next.val ){
				curr.next = temp;
				next = temp;
				continue;
			}
			curr = curr.next;
			next = next.next;
		}
		return head;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值