package com.gansuer.leetcode.array;

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

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

@@ -155,16 +155,200 @@
     
-return 0
+assert nums != null;%0A        if (nums.length %3C 3) return nums.length;%0A        int cur = 0, post = 0, pre = 1, count = 1;%0A        for (; pre %3C nums.length; ) %7B%0A        %7D%0A%0A        return cur + 1
 ;%0A  

update soluiton80