leetcode -- 26. Remove Duplicates from Sorted Array

本文主要是介绍leetcode -- 26. Remove Duplicates from Sorted Array，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

题目描述

题目难度：Easy

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 returned length.
Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4],

Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.

It doesn’t matter what values are set beyond the returned length.
Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {print(nums[i]);
}

AC代码1

自己写的代码

class Solution {public int removeDuplicates(int[] nums) {if(nums == null || nums.length == 0) return 0;int index = 0;int len = nums.length;for(int i = 0;i < len;i++){while(i + 1 < len && nums[i] == nums[i + 1]) i++;if(i + 1 == len) return index + 1;nums[++index] = nums[i + 1];}return index + 1;}
}

AC代码2

leetcode 上面的优秀代码,很简洁，而且很好理解，值得反复揣摩

class Solution {public 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]!=nums[i-1]) nums[count++]=nums[i];return count;}
}