26. Remove Duplicates from Sorted Array

题目：

Given a sorted array nums, 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 1:
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 returned length.

Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn't matter what values are set beyond the returned length.

Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, 
which means modification to the input array will be known to the caller as well.

Internally you can think of this:
// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);
// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

解释一下里面备注的意思：
Q：不明白为什么返回一个int（长度）型的值，却看到输出是一个该长度的数组？
A：因为我们传给你写的方法的类型是一个引用类型int[]，你对这个int[]里面的值做任何更改，都会改变了它所指向的值。所以你返回了int类型的长度，我们内部会用你给的len作为遍历的长度去遍历int[]的值，所以你可以看到输出是数组，就像下面这样：

Your input
[1,1,2]

Your answer
[1,2]

Expected answer
[1,2]

我的答案（这道题没什么数据结构的考察，挺简单地直接遍历即可）：

class Solution {
    public int removeDuplicates(int[] nums) {
        int containerIndex = 1;  //will be filled
        int nextValueIndex = 1;
        while(nextValueIndex < nums.length) {
            //find the next value
            if(nums[nextValueIndex] > nums[containerIndex-1]) {
                nums[containerIndex] = nums[nextValueIndex];
                containerIndex++;
            }
            nextValueIndex++;
        }
        return containerIndex;
    }
}