[LeetCode26] Remove Duplicates from Sorted Array

作为LeetCode:80的先导题,不会做80的先看这题。

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.

Subscribe to see which companies asked this question

C++实现:

从头往后依次比较,遇到不同的就把他放到前面,若要得到最后的数组结果 可以使用 nums.resize(index+1).

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.size() == 0)
		return 0;
	int index = 0;
	for (int i = 0; i < nums.size(); i++)
	{
		if (nums[index] != nums[i])
			nums[++index] = nums[i];
	}
	return index + 1;
    }
};


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/vip9504/article/details/51558217
个人分类: OJ
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭