韩顺平JAVA-D20

0184 - 0188 本章作业

1.B , C    //  正确答案B , D

2. if(bar[0])意思是bar[0]是正确的时候执行，因此输出的是blue

3.break语句和while语句的配合

4.

import java.util.Scanner;
public class Homework04{
	public static void main(String args[]){
		int a[] = {10,12,45,90};
		Scanner myScanner = new Scanner(System.in);
		do{
			int k = 0;
			int b[] = new int[a.length + 1];
			System.out.println("请输入要添加的数字");
			int add = myScanner.nextInt();
			for(int i = 0; i < a.length; i++){
				if(add >= a[i]){
					b[i] = a[i];
					k++;
					if(i == (a.length-1)){
						b[i+1] = add;
					}
				}else{
					b[i] = add;
					for(i = k; i < a.length; i++){
						b[i+1] = a[i];
					}
				}
			}
			a = b;
			System.out.println("插入后的数列为：");
			for(int j = 0; j < a.length; j++){
				System.out.print(a[j] + " ");
			}
			System.out.println("添加成功，是否继续？：y/n");
			char answer = myScanner.next().charAt(0);
			if(answer == 'n'){
				break;
			}
		}while(true);
		System.out.println("你退出了添加...");
	}
}

//5.随机生成10个整数，1-100范围，倒序打印，求均值，最大值及下标，是否有8
public class Homework05{
	public static void main(String args[]){
		int a[] = new int[10];
		double ave = 0.0;
		int sum = 0;
		int max = 0;
		int k = 0;
		int index = 0;
		for(int i = 0; i < 10; i++){
			a[i] = (int)(Math.random() * 100) + 1;
			System.out.print(a[i] + " ");
		}
		System.out.println("");
		for(int i = 9; i >= 0; i--){
			System.out.print(a[i] + " ");
		}
		System.out.println("");
		for(int i = 9; i >= 0; i--){
			sum += a[i];
			if(a[i] > max){
				max = a[i];
				k = i;
			}
			if(a[i] ==8){
				System.out.println("有8，下标为" + i);
				index ++;
			}
		}
		if(index == 0){
			System.out.println("数组中没8");
		}
		System.out.println("最大值为：" + max);
		System.out.println("最大值下标为：" + k);
	}
}

6.地址拷贝

7.

//BubbleSort
public class Homework07{
	public static void main(String args[]){
		int a[] = {66,55,44,33,22};
		int c = 0;
		int k = 0;
		for(k = 0; k < a.length-1;k++){
			for(int i = 0; i < a.length-1-k; i++){
				if(a[i] > a[i+1]){
					c = a[i];
					a[i] = a[i+1];
					a[i+1] = c;
				}
			}
		}
		for(int i = 0; i < a.length; i++){
			System.out.print(a[i] + " ");
		}
		
	}
}

0189 内容梳理

二维数组存储