classSolution{publicintfirstMissingPositive(int[] nums){int[] seen =newint[nums.length];for(int i =0; i < nums.length; i++){if(nums[i]>0&& nums[i]< nums.length+1){
seen[nums[i]-1]=1;}}for(int i =0; i < nums.length; i++){if(seen[i]!=1){return i+1;}}return nums.length+1;}}
网址题目解法1我说这题咋hard呢,贴上题目才发现我的解法消耗了额外的空间class Solution { public int firstMissingPositive(int[] nums) { int[] seen = new int[nums.length]; for(int i = 0; i &amp;lt; nums.length; i++...