26. Remove Duplicates from Sorted Array

最新推荐文章于 2022-04-06 16:22:53 发布

原创最新推荐文章于 2022-04-06 16:22:53 发布 · 223 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从有序数组中去除重复元素的方法，并提供了两种不同的Python实现方案，这两种方法都能有效地完成任务，且通过了LeetCode平台的验证。

26. Remove Duplicates from Sorted Array

Leetcode link for this question

Discription:

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.

Analyze:

Code 1 :

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return 0
        p=0
        for i in nums:
            if nums[p]!=i:
                p+=1
                nums[p]=i
        return p+1

Submission Result:

Status: Accepted
Runtime: 96 ms
Ranking: beats 80.80%

Code 2 :

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        le=len(nums)
        if le<2:
            return le
        i=1
        while i<len(nums):
            if nums[i]==nums[i-1]:
                nums.pop(i)
            else:
                i+=1
        return len(nums)