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 by modifying the input array in-place with O(1) extra memory.

Example:

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

mycode:

 package com.coderpwh.leetcode;

import org.testng.annotations.Test;

/**
 * Created by coderpwh on 2018/1/25.
 */
public class RemoveDuplicatesfromSortedArray {

    /***
     *  数组出重
     * @param nums
     * @return
     */
    public int removeDuplicates(int[] nums) {

        if (nums == null || nums.length == 0) {
            return 0;
        } else {
            int count = 1;

            for (int i = 1; i < nums.length; i++) {
                if (nums[i] != nums[i - 1]) {
                    nums[count] = nums[i];
                    count++;
                }
            }
            return count;
        }
    }

    @Test
    public void test() {
        int num[] = {1, 1, 2, 3, 3, 4};
        removeDuplicates(num);
        System.out.println(removeDuplicates(num));
    }
}

结果:

如果数组是 {1，1，2} 则结果为 2
如果是数组是{1，1，2，3，4，4} 则为4

如果数组是 {1, 1, 2, 3, 3, 4} 他的结果却是 6 ，那么问题就来了，竟然是去重，此时的结果应为4才对。