LeetCode:26. Remove Duplicates from Sorted Array
// 时间复杂度O(n),空间复杂度O(1)
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(0 == nums.size()) return 0;//保证输入异常时程序安全
int i = 0;
for(int j = 1; j<nums.size();j++){
if(nums[i] != nums[j])
nums[++i] = nums[j];
}
//i是新数组最后一个元素索引,i+1为新数组元素个数
nums.resize(i+1);
return i+1;
}
};