LeetCode算法题——26. Remove Duplicates from Sorted Array

最新推荐文章于 2024-01-02 23:35:28 发布

原创最新推荐文章于 2024-01-02 23:35:28 发布 · 429 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Remove Duplicates fr

LeetCode平台算法实现专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种在排序数组中去除重复元素的算法，并确保每个元素只出现一次。使用Python实现，该方法不需要额外的空间，仅通过原地操作完成。文章还提供了一个示例，展示如何将输入数组[1,1,1,2,2,3,5,5,7]处理为不含重复元素的形式。

题目：

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.

思想：因为数组有序，所以考虑用后一个元素与前一个比较，若相等则删除一个，若不等则index向后移动

Python 实现：

# -*- coding:utf-8 -*-
'''
Created on 2017��5��5��

@author: ZhuangLiang
'''
class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        lenth=len(nums)
        i=0;
        while i<lenth-1:
            if nums[i+1]==nums[i]:
                del nums[i]
                lenth=lenth-1
            else:
                i=i+1               
        return lenth

if __name__ == '__main__':
    num=[1,1,1,2,2,3,5,5,7]
    s=Solution()
    print(s.removeDuplicates(num))
    for i in num:
        print(i)