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

一开始没注意到是sorted array

public static int removeDuplicates(int[] nums) {        int count = 0;        for (int i = 0;i<nums.length;i++){            boolean flag  = false;            for(int j=0;j<i;j++){                if(nums[j]==nums[i]){                    flag = true;                    break;                         }            }            if(flag==false)                    nums[count++] = nums[i];        }        return count;     }

后来因为是sorted 只要比较最后一个就可以

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