Java基础：11 数组的常见应用（1）

1、 数组元素的赋值(杨辉三角等)

//打印n层的杨辉三角
import java.util.Scanner;

public class YangHui {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		System.out.println("请输入要打印的层数：");
		int l = sc.nextInt();
		int[][] yanghui = new int[l][];
		yanghui[0] = new int[] {1};
		yanghui[1] = new int[] {1,1};
		for(int i = 2;i < yanghui.length;i++) {
			yanghui[i] = new int[i+1];
			yanghui[i][0] = 1;
			yanghui[i][i] = 1;
			for(int j = 1;j < i;j++) {
				yanghui[i][j] = yanghui[i-1][j-1] + yanghui[i-1][j];
			}
		}
		for(int i = 0; i < 10;i++) {
			for(int j = 0;j < yanghui[i].length;j++) {
				System.out.print(yanghui[i][j] + "\t");
			}
			System.out.println();
		}
	}
}

2、求数值型数组中元素的最大值、最小值、平均数、总和等

public class ArrTest {
	public static void main(String[] args) {
		int[] arr = new int[] {12,54,678,-233,0,3};
		getMax(arr);
		getMin(arr);
		getSum(arr);
	}
	//求最大值
	public static void getMax(int[] arr) {
		int max = arr[0];
		for(int i = 1;i < arr.length;i++) {
			if(max < arr[i]) {
				max = arr[i];
			}
		}
		System.out.println("数组的最大值为：" + max);

	}
	//求最小值
	public static void getMin(int[] arr) {
		int min = arr[0];
		for(int i = 1;i < arr.length;i++) {
			if(min > arr[i]) {
				min = arr[i];
			}
		}
		System.out.println("数组的最小值为：" + min);

	}
	//求和、求平均值
	public static void getSum(int[] arr) {
		int sum = arr[0];
		for(int i = 1;i < arr.length;i++) {
			sum += arr[i];
		}
		System.out.println("数组的和为：" + sum);
		System.out.println("数组的平均值为：" + sum/arr.length);

	}

}

3、数组的复制、反转

public class ArrTest {
	public static void main(String[] args) {
		int[] arr = new int[] {12,54,678,-233,0,3};
		int[] arr1 = new int[arr.length];
		int[] arr2 = new int[arr.length];
 		getClone(arr,arr1);
 		display(arr1);
 		getReversal(arr,arr2);
		display(arr2);
	}
	//数组的复制
	public static void getClone(int[] arr,int[] arr1) {
		for(int i = 0;i < arr.length;i++) {
			arr1[i] = arr[i];
		}
		
	}
	//数组的反转
	public static void getReversal(int[] arr,int[] arr2) {
		for(int i = 0;i < arr.length;i++) {
			arr2[arr2.length-i-1] = arr[i];
		}

	}
	//数组的遍历
	public static void display(int[] arr) {
		for(int i:arr) {
			System.out.print(i + " ");
		}
		System.out.println();

	}

}

4、数组的查找(线性查找、二分法查找)

//二分法查找：要求此数组必须是有序的。 
public class ArrTest {
	public static void main(String[] args) {
		int[] arr = new int[]{-99,-54,-2,0,2,33,43,256,999};
		boolean isFlag = true; 
		int number = 256; //需要查找的元素
		int head = 0;//首索引位置 
		int end = arr.length - 1;//尾索引位置 
		while(head <= end){ 
		    int middle = (head + end) / 2; 
		    if(arr[middle] == number){ 
		        System.out.println("找到指定的元素，索引为：" + middle); 
		        isFlag = false; 
		        break; 
		    }else if(arr[middle] > number){ 
		        end = middle - 1; 
		    }else{ 
		        head = middle + 1; 
		    } 
		} 
		if(isFlag){
		     System.out.println("未找到指定的元素"); 
		 }
	}

}