第七周作业

1.定义长度位5的整型数组，输入他们的值用冒泡排序后输出.

package li;

public class Test7 {
    public static void main(String[] args) {
        int[] a = new int[] {5,9,51,4,56 };
        int t;
        for (int i = 0; i < a.length-1; i++) {
            for (int j = 0; j < a.length-1-i;j++) {
                if (a[j + 1] > a[j]) {
                    t = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = t;
                }
            }
        }
        for (int j = 0; j < a.length; j++) {
            System.out.print(a[j] + ", ");
        }
    }
}

 

 

 

2.定义数组{34,22,35,67 ,45,66,12,33}输入-个数a，查找在数组中是否存在，如果存在,输出下标，不存在输出"not found"

package li;
import java.util.Random;
public class Test7 {
    public static void main(String[] args) {
        Random r = new Random(); 

        int k = r.nextInt(3)+ 3;
        for(int j = 0;j< 10; j++) {
            int i = r.nextInt(100);
            System.out.println( i );
        }
    }
}

 

 

 

3.以矩阵的形式输出一-个double型二维数组(长度分别为5、4 ,值自己设定)的值

package li;

import java.util.Random;

public class Test7 {
    public static void main(String[] args) {
        int a[] = new int[7];
        int i, m, j;
        fan: for (j = 0; j < 7; j++) {
            a[j] = (int) (Math.random() * 35 + 1);
            m = a[j];
            if (j >= 1) {
                for (i = 0; i < j; i++)
                    if (a[i] == m) {
                        j--;
                        continue fan;
                    }
            }
            if (a[j] < 10)
                System.out.print("0" + a[j] + "  ");
            else
                System.out.print(a[j] + "  ");
        }
    }

    public static void main1(String args[]) {
        int n = Integer.parseInt(args[0]);
        System.out.println("中国福利彩票35选7");
        for (int i = 0; i < n; i++) {
            System.out.println();
        }
    }
}

 

 

 

4.定义一个二维数组(长度分别为3,4,值自己设定),求该二维数组的最大值.

package li;

import java.util.Random;

public class Test7 {

public static void main(String[] args) {
// TODO Auto-generated method stub
int a[] = {1,2,3,4,5,6,7,8,9,10};
int max = a[0];
int min = a[0];
int countQ = 0;
int countO = 0;
for (int i = 0; i < a.length; i++) {
if (a[i]>max) {
max = a[i];
}
if (a[i]<min) {
min = a[i];
}
if (a[i]%2==0) {
countQ += 1;
}else {
countO += 1;
}
}
System.out.println("数组的最大值为：" + max);
System.out.println("数组的最小值为：" + min);
System.out.println("数组的偶数个数为：" + countO);
System.out.println("数组的奇数个数为：" + countQ);
}

}