1.蛇形打印数组
package Array; import java.util.Scanner; public class Enght2 { public static void main(String[] args) { Scanner sc=new Scanner(System.in); System.out.println("请输入需要打印的行数"); int n=sc.nextInt(); int m = 0; int k = 0; int[][] a = new int[n][n]; int[][] b = new int[n][n]; if(n %2 ==0){ m = n; }else{ m = n/2 +1; } for(int i = 0;i<m;i++){ for(int j = i;j<n -i;j++){ k++; a[i][j] = k; } for(int j = i+1; j<n -i;j++){ k++; a[j][n-1-i]= k; } for(int j = n-i-2;j>=i;j--){ k++; a[n-i-1][j] =k; } for(int j = n-i-2;j>=i+1;j--){ k++; a[j][i] = k; } } for(int i = 0;i<a.length;i++){ for(int j = 0;j<a.length;j++){ if(a[i][j] <10){ System.out.print(" "); } System.out.print(a[i][j] + " "); } System.out.println(); } } }2.竖型打印蛇形
package Array; import java.util.Arrays; public class Seven { public static void main(String[] args) { int n=5; int[][]a=new int[n][n]; int count=1; for (int i=0;i<a.length;i++){ if (i%2==0){ for (int j=0;j<a[i].length;j++){ a[j][i]=count++; } }else{ for (int j=a[i].length-1;j>=0;j--){ a[j][i]=count++; } } } for (int i=0;i<a.length;i++){ System.out.println(Arrays.toString(a[i])); } } }3.竖列数组
package Array; import java.util.Arrays; public class Six { public static void main(String[] args) { int n=5; int[][]a=new int[n][n]; int count=1; for (int i=0;i<a.length;i++){ for (int j=0;j<a[i].length;j++){ a[j][i]=count++; } } for (int i=0;i<a.length;i++){ System.out.println(Arrays.toString(a[i])); } } }4横列数组
package Array; import java.util.Arrays; public class Five { public static void main(String[] args) { int n=5; int[][]a=new int[n][n]; int count=1; for ( int i=0;i<a.length;i++){ for (int j=0;j<a.length;j++){ a[i][j]=count++; } System.out.println(Arrays.toString(a[i])); } } }5.n个数从大到小排序
package Array; import java.util.Scanner; public class Two { public static void main(String[] args) { int [] n=new int[6]; Scanner sc = new Scanner(System.in); for (int i=0;i<n.length;i++) { System.out.println("请输入第" + (i + 1) + "个数:"); n[i] = sc.nextInt(); } for(int i=0;i<n.length-1;i++){ for(int j=0;j<n.length-i-1;j++){ if(n[j]<n[j+1]){ int temp=n[j]; n[j]=n[j+1]; n[j+1]=temp; } } } for(int i=0;i<n.length;i++) System.out.print(n[i]+"\t"); System.out.println(); } }6.N个数从小到大排序
package Array; import java.util.Scanner; public class One { public static void main(String[] args) { int [] n=new int[5]; Scanner sc = new Scanner(System.in); for (int i=0;i<n.length;i++) { System.out.println("请输入第" + (i + 1) + "个数:"); n[i] = sc.nextInt(); } for(int i=0;i<n.length-1;i++){ for(int j=0;j<n.length-i-1;j++){ if(n[j]>n[j+1]){ int temp=n[j]; n[j]=n[j+1]; n[j+1]=temp; } } } for(int i=0;i<n.length;i++) System.out.print(n[i]+"\t"); System.out.println(); } }