LeetCode：從排序數組中刪除重復項

C++示例程序：

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