趣味代码.docVIP

直接插入排序 public class MainClass { public static void main(String[] args) { int arrInt[]={3,1,5,6,2,4,0}; insertSort(arrInt); for(int i:arrInt){ System.out.println(i); } } static int[] insertSort(int []arrInt){ int temp; for(int i=1;iarrInt.length;i++){ temp=arrInt[i]; for(int j=i-1;j=0;j--){ if(arrInt[j]temp){ arrInt[j+1]=arrInt[j]; arrInt[j]=temp; } } } return arrInt; } } 输入矩阵，输出，置换并输出： public class MainClass { public static void main(String[] args) { int [][]matrix=getMatrix(); MainClass.printMatrix(matrix); MainClass.printMatrix(reverseMatrix(matrix)); } static int[][] getMatrix() { //字符串向量，保存多行字符串 //每行字符串表示一行矩阵，每个元素之间以空格间隔,如：1 2 3 4 Scanner scan = new Scanner(System.in); VectorString strV = new VectorString(); String str; int k = 1; while (true) { System.out.println(请输入矩阵第 + (k++) + 行：(输入n结束！)); str = scan.nextLine().trim(); if (!str.equals(n)) { strV.addElement(str); } else { break; } } //计算矩阵的行列数 String temp = strV.get(0); int row = strV.size(); int column = 1; for (char c : temp.toCharArray()) { if (c == ) column++; } int matrix[][] = new int[row][column]; System.out.println(本矩阵有+row+行，+column+列。); //将字符串向量转换为矩阵(二维整型数组) for (int i = 0; i row; i++) { temp = strV.get(i); String s = ; column=0; for (int j = 0; j temp.length(); j++) { char c=temp.charAt(j); if(c!= ){ s+=c; }else { matrix[i][column++]=Integer.parseInt(s); s=; } if(j==temp.length()-1){ matrix[i][column]=Integer.parseInt(s); } } } return matrix; } //输出矩阵 static void printMatrix(int matrix[][]) { for (int i = 0; i matrix.length; i++) { for (int j = 0; j matrix[i].length; j++) { System.out.print(matrix[i][j] + ); } System.out.println(); } } static int[][] reverseMatrix(int matrix[][]){ int row=matrix[0].length; int column=matrix.length; int[][] temp=n