[leetcode]Remove Duplicates from Sorted Array（Java实现）

本题为leetcode题库28：

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.

Subscribe to see which companies asked this question.

牛客网测试地址：https://www.nowcoder.com/questionTerminal/a519784e89fb40199fbe7993786715b1

Java代码如下：

package go.jacob.day523;

public class Demo1 {
public int removeDuplicates(int[] nums) {
//异常输入
if(nums==null||nums.length<=1)
return nums==null?0:nums.length;
int count=1;
for(int i=1;i<nums.length;i++){
//如果数组当前元素与前一个元素不同，则加入新数组
if(nums[i]!=nums[i-1])
nums[count++]=nums[i];
}
return count;
}
}