算法作业HW25：LeetCode 26. Remove Duplicates from Sorted Array

Description:

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.

Note:

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.

Solution:

  Analysis and Thinking:

题目要求对于一个给定的排序数组，移除当中的重复元素，并返回新的数组的长度。比较简单的题，分析题目与输入，设置一个循环即可

  Steps:

1. 设置一个记录变量count，用于统计不重复元素的数量

2. 遍历数组，对于其中的每一个元素，如果比其前一个元素大，则count+1，且将当前元素前移一位

3.返回最后的计数结果count

Codes:

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
    int count = 0;
    for (int element : nums)
        if (!count || element > nums[count-1])
            nums[count++] = element;
    return count;
}
};

Results: