LeetCode - 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.

思路：

维持一个index，只要下一个数跟前一个数不相同就增加并赋值

package array;

public class RemoveDuplicatesFromSortedArray {

    public int removeDuplicates(int[] nums) {
        int len = 0;
        if (nums == null || (len = nums.length) < 2) return len;
        int pos = 1;
        for (int i = 1; i < len; ++i) {
            if (nums[i] != nums[i - 1])
                nums[pos++] = nums[i];
        }
        
        return pos;
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub

    }

}

LeetCode - Remove Duplicates from Sorted Array

标签：

原文地址：http://www.cnblogs.com/shuaiwhu/p/5062377.html