leetcode 83.Remove Duplicates from Sorted List-链表去重

最新推荐文章于 2024-09-18 15:03:01 发布

Code_Granker

最新推荐文章于 2024-09-18 15:03:01 发布

阅读量1.6k

点赞数 1

分类专栏： LeetCode 文章标签： leetcode Python Java

本文链接：https://blog.csdn.net/happyaaaaaaaaaaa/article/details/48920813

版权

LeetCode 专栏收录该内容

167 篇文章 0 订阅

订阅专栏

原题链接：83.Remove Duplicates from Sorted List

【思路】

思路很简单，逐一比较相邻两个节点的值，当遇到相同的值时，就将后一个节点从链表中移去：

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

164 / 164 test cases passed. Runtime: 1 ms Your runtime beats 16.98% of javasubmissions.

class Solution(object):
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        p = head
        while p != None and p.next != None :
            if p.val == p.next.val :
                p.next = p.next.next
            else :
                p = p.next
        return head

164 / 164 test cases passed. Runtime: 72 ms Your runtime beats 33.61% of pythonsubmissions.