(Java)LeetCode-26. 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 in place with constant memory.

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.

这道题蛮简单的，用两个数组，一个指针指向前面即将要被替换的数，一个指针遍历数组找到重复的即可。这题只是个铺垫而已~

public class Solution {
public int removeDuplicates(int[] nums) {
int changed = 1;
int n = 1;
while( n < nums.length){
if( nums
!= nums[changed-1]){
nums[changed] = nums
;
changed++;
}
n++;

}
return changed;
}
}