Remove Duplicates from Sorted Array [Python]

最新推荐文章于 2025-08-23 20:28:56 发布

转载最新推荐文章于 2025-08-23 20:28:56 发布 · 44 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/llguanli/p/7159790.html

文章标签：

#python

本文介绍了一个高效的算法，用于在不使用额外空间的情况下移除已排序数组中的重复元素，并返回处理后数组的新长度。该算法通过双指针技术实现，确保了操作在常数时间内完成。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

#-*- coding:utf-8 -*-

class Solution:
    # @param {integer[]} nums
    # @return {integer}
    def removeDuplicates(self, nums):
    	l = len(nums)
    	if l == 0:
    		return 0
    	index = 0
    	i = 1
    	nums[index] = nums[0]
    	while i<l:
    		if nums[index] != nums[i]:
    			index += 1
    			nums[index] = nums[i]
    		i += 1
    	return index+1


if __name__=="__main__":
    s = Solution()
    print s.removeDuplicates(x)

转载于:https://www.cnblogs.com/llguanli/p/7159790.html