leetcode每日一题-25
public static int removeDuplicates(int[] nums) {
if(nums==null||nums.length==0) return 0;
int count=1;
for (int i = 1; i < nums.length; i++) {
if (nums[i-1]!=nums[i]) {
nums[count]=nums[i];
count++;
}
}
return count;
}
public static int removeDuplicates(int[] nums) {
if(nums==null||nums.length==0) return 0;
int count=1;
for (int i = 1; i < nums.length; i++) {
if (nums[i-1]!=nums[i]) {
nums[count]=nums[i];
count++;
}
}
return count;
}
全部评论
相关推荐

点赞 评论 收藏
分享
点赞 评论 收藏
分享