lc-26

登录后复制

   public int removeDuplicates(int[] nums) {
        int pre = nums[0];
        int ans = 1;
        int n = nums.length;
        for (int i = 1; i < n; i++) {
            if (pre != nums[i]) {
                nums[ans] = nums[i];
                ans++;
            }
            pre = nums[i];
        }
        return ans;
    

• 1.
• 2.
• 3.
• 4.
• 5.
• 6.
• 7.
• 8.
• 9.
• 10.
• 11.
• 12.
• 13.

原创作者: u_14066730 转载于: https://blog.51cto.com/u_14066730/11823381