Java [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.

解題思路：

對組遍曆一次，並且設定一個計數器，當數組前後的元素不一樣時計數器加一，同時將不一樣的數字放到對應計數器的位置處。

代碼如下：

public int removeDuplicates(int[] nums) {int length = nums.length;int count = 1;if (length == 0)return 0;for (int i = 1; i < nums.length; i++) {if (nums[i - 1] == nums[i])continue;else {nums[count] = nums[i];count++;}}return count;}

 

Java [leetcode 26]Remove Duplicates from Sorted Array