LeetCode26. Remove Duplicates from Sorted Array

LeetCode26. 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 by modifying the input array in-place with O(1) extra memory.

Example:

Given 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.

題目分析：判斷前面的那個是否重複，如果重複，則size++。

for (int i = 1; i < nums.size(); i++) {
	if (nums[i] != nums[i - 1]) {
		nums[len++] = nums[i];
	}
}

代碼：

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