package com.gansuer.leetcode.array;

/**
 * Created by Frank on 3/23/16.
 */
public class Solution80 {

    public int removeDuplicates(int[] nums) {
        return 0;
    }
}

package com.gansuer.leetcode.array;

/**
 * Created by Frank on 3/23/16.
 */
public class Solution80 {

    public int removeDuplicates(int[] nums) {
        assert nums != null;
        if (nums.length < 3) return nums.length;
        int cur = 0, post = 0, pre = 1, count = 1;
        for (; pre < nums.length; ) {
        }

        return cur + 1;
    }
}

update soluiton80