classSolution{ publicintremoveDuplicates(int[]nums){ HashMap win=newHash...

public static Listtask1(int[] nums){ back(nums,0,new ArrayList()); ret...

publicintfindUnsortedSubarray(int[]nums){ int[]kk=newint[nums.length]; f...

publicintans; publicintrangeSumBST(TreeNoderoot,intlow,inthigh){ dfs(roo...

找到缺失的第一个正数 publicintfirstMissingPositive(int[]nums){ HashMaphash=newHash...

public static int task44(int[] nums){ int[] dp =new int[nums.length+2];...

publicStringremoveDuplicates(Strings){ Stack<Character>stack=newStack();...

public static ArrayListresult =new ArrayList(); public static Listtask...

//堆排序 public static int[]heap(int[] nums){ for(int i = nums.length/2 -1;...