classSolution961{publicstaticvoidmain(String[] args){System.out.println(repeatedNTimes(newint[]{1,2,3,3}));}publicstaticintrepeatedNTimes(int[] nums){int resNum =0;int[] res =newint[10000];for(int i =0; i < nums.length; i++){
res[nums[i]]++;if(res[nums[i]]>=2){return nums[i];}}return-1;}}
944.删列造序
classSolution944{publicstaticvoidmain(String[] args){System.out.println(minDeletionSize(newString[]{"cba","daf","ghi"}));}publicstaticintminDeletionSize(String[] strings){int res =0;for(int i =0; i < strings[0].length(); i++){for(int j =0; j < strings.length -1; j++){if(strings[j].charAt(i)> strings[j +1].charAt(i)){
res++;}}}return res;}}
classSolution914{publicstaticvoidmain(String[] args){System.out.println(hasGroupsSizeX(newint[]{1,1,1,2,2,2,3,3,3}));}publicstaticbooleanhasGroupsSizeX(int[] deck){int[] count =newint[10000];for(int c : deck){
count[c]++;}int g =0;for(int i =0; i <10000;++i){if(count[i]==0)continue;
g =gcd(count[i], g);if(g ==1)returnfalse;}returntrue;}publicstaticintgcd(int x,int y){return x ==0? y :gcd(y % x, x);}}
905.按奇偶排序数组
classSolution905{publicstaticvoidmain(String[] args){System.out.println(Arrays.toString(sortArrayByParity(newint[]{1,3,2,4})));}publicstaticint[]sortArrayByParity(int[] nums){int i =0;int j = nums.length-1;while(i<j){while(nums[i]%2==0&& i < j){
i++;}while(nums[j]%2!=0&& i < j){
j--;}int tmp = nums[i];
nums[i]= nums[j];
nums[j]= tmp;}return nums;}}
classSolution868{publicstaticvoidmain(String[] args){System.out.println(binaryGap(22));}publicstaticintbinaryGap(int n){int res =0;int index =0;while(n !=0){if((n &1)==1){
res =(index > res ? index : res);
index =1;}elseif(index >0){
index++;}
n = n >>>1;}return res;}}
867.求一个矩阵的转置矩阵
classSolution867{publicstaticvoidmain(String[] args){int[][] matrix ={{1,2,3},{4,5,6}};int[][] res =transpose(matrix);for(int i =0; i < res.length; i++){System.out.println(Arrays.toString(res[i]));}}publicstaticint[][]transpose(int[][] matrix){int[][] res =newint[matrix[0].length][matrix.length];for(int i =0; i < matrix[0].length; i++){for(int j =0; j < matrix.length; j++){
res[i][j]= matrix[j][i];}}return res;}}