美文网首页ACM题库~
LeetCode 83. Remove Duplicates f

LeetCode 83. Remove Duplicates f

作者: 关玮琳linSir | 来源:发表于2017-09-27 16:15 被阅读16次

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.

题意:给一个有序的链表,让我们去掉重复的节点。

java代码:

public ListNode deleteDuplicates(ListNode head) {
        ListNode h1 = head;
        while(h1 != null && h1.next != null){
            if (h1.val == h1.next.val) {
                h1.next = h1.next.next;
            }else {
                h1 = h1.next;
            }
        }
        return head;
    }

相关文章

网友评论

    本文标题:LeetCode 83. Remove Duplicates f

    本文链接:https://www.haomeiwen.com/subject/kuvuextx.html