Java自学 --换车重启4

---

冒泡排序

import java.util.Scanner;
public class Test04 {
    public static void main(String[] args){
        int[] array = {10,9,8,7,6,5,4,3,2,1};
        for (int i = 0; i < array.length-1; i++) {

                for (int j = 0; j < array.length-1-i; j++) {
                    int temp = 0;

                    if(array[j] > array[j+1]){
                        temp = array[j];
                        array[j] = array[j+1];
                        array[j+1] = temp;
                    }
                }
                System.out.println("\n"+"第"+(i+1)+"次排序：");
                for (int k = 0; k < array.length; k++) {
                    System.out.print(array[k]+"\t");
                }

        }
    }
}

---

杨辉三角

public class Test04 {
    public static void main(String[] args){
        int arr[][] = new int[10][] ;
        for (int i = 0; i < arr.length; i++) {
            arr[i] =new int[i+1];
            for (int j = 0; j < arr[i].length; j++) {
                if(j == 0 || j == arr[i].length-1){
                    arr[i][j] = 1;
                }else{
                    arr[i][j] = arr[i-1][j-1] + arr[i-1][j];
                }
            }
        }
        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                System.out.print(arr[i][j]+" ");
            }
            System.out.println();
        }
    }
}

---

二位数组使用细节

• 一维数组的声明方式有:

  ​ int[] x 或者 int x[]

• 二维数组的声明方式有:

  int[][] y 或者int[] y[] 或者int y[][]

• 二维数组实际上是由多个一维数组组成的，它的各个一维数组的长度可以相同，也可以不相同。

  ​ 比如： map[][] 是 一个二维数组 int[] [] map [][] = {{1,2},{3,4,5}}

---

练习

public class Test04 {
    public static void main(String[] args){

        int[] array = new int[10];
        int sum = 0;
        for (int i = 0; i < array.length; i++) {
            array[i] = (int)(Math.random()*100+1);
            sum += array[i];
        }
        System.out.println("随机数组为：");
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] +" ");
        }
        System.out.println("\n"+"该数组总和为：" + sum);
        System.out.println("该数组平均数为："+ (sum/10.0));

        for (int i = 0; i < array.length - 1; i++) {


            for (int j = 0; j < array.length - 1 - i; j++) {

                if(array[j] < array[j+1]){
                    int temp;
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1] = temp;
                }
            }

        }


        System.out.println("倒序排序后的数组为：");
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] +" ");
        }

    }
}

---

定位+扩容练习 （加强）

//先定位  后赋值
//这题很有意思，我的思想是直接扩容后排序，我是听了一遍然后按理解打一遍
//老师既然这么做，可能这样比较有效率？
public class Test04 {
    public static void main(String[] args){
        int[] array = {10,12,45,90};
        int newNum = 23;
        int index = -1;
        for (int i = 0; i < array.length; i++) {
            if (array[i]>newNum){
                index = i;
                break;
            }
        }
        if(index == -1){
            index = array.length;
        }
        int[] newArray = new int[array.length+1];
        for (int i = 0,j = 0; i < newArray.length; i++) {
            if(i != index){
                newArray[i] = array[j];
                j++;
            }else {
                newArray[i] = newNum;
            }

        }
        for (int i = 0; i < newArray.length; i++) {
            System.out.print(newArray[i]+"\t");
        }
    }
}