Java [leetcode 26]Remove Duplicates from Sorted Array

浏览数：42 / 时间：2015年06月08日

题目描述：

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