p26删除排序数组中的重复项

package LeetCode.双指针;

import org.junit.Test;

import java.util.LinkedList;
import java.util.Queue;

public class p26删除重复 {

    /*双指针*/
    public int removeDuplicates(int[] nums) {
        int i=0;
        for (int j = 0; j < nums.length; j++) {
            if (nums[i]<nums[j])
            nums[++i] = nums[j];
        }
        return ++i;
    }
   /*暴力循环*/
   public int removeDuplicatesT(int[] nums) {
        int len = 0;
        int max = -0x3f3f3f3f;
        for(int i=0;i<nums.length;i++){
            if (nums[i]>max) {
                max = nums[i];
                for (int j = i; j < nums.length; j++) {
                    if (nums[j] != nums[i] && nums[j] > nums[i]) {
                        nums[i + 1] = nums[j];
                        len++;
                        break;
                    }
                }
            }
        }
        return len+1;
    }
    /*使用集合*/
  public int removeDuplicatesTT(int[] nums) {
        Queue<Integer> queue = new LinkedList<>();
       for (int i=0;i<nums.length;i++)
       {
           if (!queue.contains(nums[i])) queue.add(nums[i]);
       }
        int len = queue.size();
        for (int j = 0; j < len; j++) {
            nums[j]=queue.poll();
        }
        return len;
    }
    @Test
    public void main(){
        //{0,0,1,1,1,2,2,3,3,4}
        //{1,1,2}
        int len = removeDuplicates(new int[]{1,1,2});
        System.out.println(len);
    }
    
}