classSolution{publicintfindRepeatNumber(int[] nums){int len = nums.length;boolean[] vis =newboolean[len];for(int i:nums){if(vis[i]==true)return i;
vis[i]=true;}return-1;}}
布尔数组class Solution { public int findRepeatNumber(int[] nums) { int len = nums.length; boolean[] vis = new boolean[len]; for(int i:nums){ if(vis[i]==true) retu...