26. Remove Duplicates from Sorted Array
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++：
//
// main26.cpp
// LeetCode
//
// Created by linSir on 2017/9/7.
// Copyright © 2017年 58qifu. All rights reserved.
//
#include <stdio.h>
#include <string>
#include <vector>
#include <iostream>
class Solution {
public:
int removeDuplicates(std::vector<int>& nums) {
if ( nums.size()== 0) {
return 0;
}
int count = 1;
for (int i = 0; i < nums.size() - 1; i++) {
if (!(nums[i] == nums[i + 1])) {
nums[count] = nums[i + 1];
count++;
}
}
return count;
}
};
