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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

链接： http://leetcode.com/problems/remove-duplicates-from-sorted-array/

题解：

从数组中移除重复值。这样写是偷懒了，其实想了想应该把重复值和数组末尾元素swap。Time Complexity - O(n)，Space Complexity - O(1)

public class Solution {
    public int removeDuplicates(int[] A) {
        if(A == null || A.length == 0)
            return 0;
        int count = 1;

        for(int i = 1; i < A.length; i++)
            if(A[i] != A[i - 1])
                A[count++] = A[i];

        return count;
    }
}

26. Remove Duplicates from Sorted Array

原文：http://www.cnblogs.com/yrbbest/p/4434967.html