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.

二、问题分析

计算排序数组中非重复元素的个数n，并将数组中的前n个元素替换成非重复元素

三、代码

public class Solution {
public int removeDuplicates(int[] nums) {
if(nums==null || nums.length==0)
return 0;
int cur=1;//记录非重复元素的个数
int temp=nums[0];
for(int i=1;i<nums.length;i++){
if(nums[i]!=temp){
temp=nums[i];
nums[cur]=temp;
cur++;
}
}
return cur;
}
}