第六周上机作业
1.定义长度位5的整型数组,输入他们的值,用冒泡排序后输出.
package yugh; public class yu { public static void main(String[] args) { int[] arr = {3,5,9,7,1}; for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr.length-1-i; j++) { int num = 0; if(arr[j] > arr[j+1]){ num = arr[j]; arr[j]= arr[j+1]; arr[j+1] = num; } } } for (int i : arr) { System.out.println(i); } } }
2.定义数组{34,22,35,67,45,66,12,33},输入一个数a,查找在数组中是否存在,如果存在,输出下标,不存在输出"not found"
package yugh; import java.util.*; public class he { public static void main(String[] args) { // TODO Auto-generated method stub int []a={34,22,35,67,45,66,12,33}; int c=0; Scanner input=new Scanner(System.in); System.out.println("输入一个数"); int x=input.nextInt(); for (int i = 0; i < a.length; i++) { if(x==a[i]){ c=1; System.out.println(i); } } if(c==0){ System.out.println("no"); } } }
3.以矩阵的形式输出一个double型二维数组(长度分别为5、4,值自己设定)的值。
package det;
public class yeah {
public static void main(String[] args) {
double[][]arr={{1,4,7,8},{2,5,8,3},{3,6,9,1},{1,2,3,4},{5,6,4,1}}; 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 det;
public class yeah {
public static void main(String[] args) {
int[][]arr={{1,2,3,4},{2,3,4,5},{3,4,5,6}}; int max=0; int i,j; for(i=0;i<3;i++){ for(j=0;j<4;j++){ if(arr[i][j]>max){ max=arr[i][j]; } } } System.out.println(max);} }