关闭

Remove Duplicates from Sorted Array

标签: 数组
109人阅读 评论(0) 收藏 举报
分类:

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.


C++

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.empty())
            return 0;

        int index = 0;
        for(int i = 1; i < nums.size(); i++)
        {
            if(nums[index] != nums[i])
                nums[++index] = nums[i];
        }
        return index + 1;
    }
};

Java

public class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length == 0)
                return 0;

            int index = 0;
            for(int i = 1; i < nums.length; i++)
            {
                if(nums[index] != nums[i])
                    nums[++index] = nums[i];
            }
            return index + 1;
    }
}

Python

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 0:
            return 0;

        index = 0
        n = len(nums)
        for i in range(n):
            if nums[index] != nums[i]:
                index += 1
                nums[index] = nums[i]
        return index + 1
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:64506次
    • 积分:1861
    • 等级:
    • 排名:千里之外
    • 原创:125篇
    • 转载:6篇
    • 译文:0篇
    • 评论:4条
    最新评论