26. Remove Duplicates from Sorted Array java solutions

weixin_30570101

于 2016-05-02 21:47:00 发布

阅读量56

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/guoguolan/p/5453234.html

本文介绍了一个不使用额外空间，仅利用常数级内存在原地去除已排序数组中重复元素的方法。通过一次遍历，当遇到不同元素时进行替换并记录新长度。此算法适用于输入如 [1,1,2] 的数组，返回长度为2，且数组的前两个元素分别为1和2。

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.

Subscribe to see which companies asked this question

 1 public class Solution {
 2     public int removeDuplicates(int[] nums) {
 3         if(nums.length == 0 || nums.length == 1) return nums.length;
 4         int len = 1;
 5         for(int i = 1;i<nums.length;i++){
 6             if(nums[i] != nums[i-1]) nums[len++] = nums[i];
 7         }
 8         return len;
 9     }
10 }