Given a sorted array, remove the duplicates in place such that each element appear onlyonceand return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input arraynums=[1,1,2],
Your function should return length =2, with the first two elements ofnumsbeing1and2respectively. It doesn't matter what you leave beyond the new length.
代码的间接性很重要啊！！！这是stefan 大神的代码！
