关闭

[LeetCode26] Remove Duplicates from Sorted Array

663人阅读 评论(0) 收藏 举报
分类:

作为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;
    }
};


0
0

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