1.定义长度位5的整型数组,输入他们的值,用冒泡排序后输出.
package qq; import java.util.Scanner; public class Ee { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input=new Scanner(System.in); int arr[]={29,14,56,36,48}; for(int i=0;i<4;i++){ for(int a=0;a<4-i;a++){ if(arr[a]>arr[a+1]){ int j=arr[a]; arr[a]=arr[a+1]; arr[a+1]=j; } } } for(int i=0;i<5;i++){ System.out.println(arr[i]); } } }
2.定义数组
package qq; import java.util.Scanner; public class Ee { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input=new Scanner(System.in); int arr[]={34,22,35,67,45,66,12,33}; System.out.println("请输入一个数a:"); int b=input.nextInt(); boolean yes=false; for(int i=0;i<arr.length;i++) { if(arr[i]==b) { System.out.println("数的下标为:"+i); yes=true; } } if(yes==false) System.out.println("not found"); } }
3.以矩阵的形式输出一个double型二维数组(长度分别为5、4,值自己设定)的值。
package qq; import java.util.Scanner; public class Ee { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input=new Scanner(System.in); double arr[][]={{1,2,3,4},{5,6,7,8},{10,11,12,13},{14,15,16,17},{18,19,20,21}}; for(int i=0;i<5;i++){ for(int j=0;j<4;j++){ System.out.print(arr[i][j]+" "); } System.out.println(""); } } }
4.定义一个二维数组(长度分别为3,4,值自己设定),求该二维数组的最大值.
package qq; import java.util.Scanner; public class Ee { public static void main(String[] args) { // TODO Auto-generated method stub Scanner input=new Scanner(System.in); int max=0; int arr[][]={{1,2,3,4},{5,6,7,8},{10,11,12,13}}; for(int i=0;i<3;i++){ for(int j=0;j<4;j++){ if(arr[i][j]>max){ max=arr[i][j]; } } } System.out.println("最大值为"+max); } }