public class Solution {
public int removeDuplicates(int[] nums) {
int cnt=0;
if(nums.length==0)return cnt;
if(nums.length==1)return 1;
for(int i=0;i<nums.length-1;i++){
if(nums[i]!=nums[i+1]){
nums[cnt]=nums[i];
cnt++;
}
}
nums[cnt]=nums[nums.length-1];
return cnt+1;
}
}
public int removeDuplicates(int[] nums) {
int cnt=0;
if(nums.length==0)return cnt;
if(nums.length==1)return 1;
for(int i=0;i<nums.length-1;i++){
if(nums[i]!=nums[i+1]){
nums[cnt]=nums[i];
cnt++;
}
}
nums[cnt]=nums[nums.length-1];
return cnt+1;
}
}