JAVA—Day9 of Self-Learning JAVA（Arrays Class + 2-Demension Ayrray）

JAVA—Day9 of Self-Learning JAVA （Arrays Class + 2-Demension Ayrray）

Nothing in this world can take place of the place of good old persistense

Due Today：

• Array Class
• 2-Dimension Array
• Exercise

Array Class:

import java.util.Arrays;

/*
 * Arrays类包含常用的数组操作：
 * 排序、查找、填充、打印内容
 */

public class AyyaysClass {
	public static void main(String [] args) {
		
		//ArraystoString()
		int [] arr = {2,7,33,55,22,9,'a',22};
		System.out.println(arr); //打印数组reference value
		System.out.println(Arrays.toString(arr));
		System.out.println("----------------------------------");
		
		//equals
		int [] arr1 = {3,2,6,8,90,-13,'a'};
		int [] arr2 = {3,2,6,8,90,-13,'a'};
		int [] arr3 = arr1;
		//比较的是引用对象是否相同
		System.out.println(arr1.equals(arr2));
		System.out.println(arr1.equals(arr3));
		//比较的是数组是否以相同顺序包含相同的元素
		System.out.println(Arrays.equals(arr1, arr2));
		System.out.println("----------------------------------");
		
		//copyOf（）
		int [] arrA = {3,2,6,8,90,-13,'a'};
		int [] arrB = new int[arrA.length];
		arrB = Arrays.copyOf(arrA,7);//重新开辟空间
		System.out.println(Arrays.toString(arrB));
		System.out.println("----------------------------------");
		
		//Arrays.fill(int [] a,int val)----Arrays.fill(int [] a,int fromIndex,int toIndex,int val)
		int [] arrx = {3,2,6,8,90,-13,'a'};
		Arrays.fill(arrx,9);
		System.out.println(Arrays.toString(arrx));
		Arrays.fill(arrx,0,2,100);
		System.out.println(Arrays.toString(arrx));
		System.out.println("----------------------------------");
		
		//sort:升序排序
		Arrays.sort(arr,0,5);
		System.out.println(Arrays.toString(arr));
		System.out.println("----------------------------------");
		
		//二分查找
		int [] arry = {3,2,6,8,90,-13,'a'};
		Arrays.sort(arry);
		System.out.println(Arrays.toString(arry));
		System.out.println(Arrays.binarySearch(arry,90));
	}
}

2-Dimension Array:

import java.util.Arrays;

/*
 * 2维数组
 * 
 */

public class Array_MultiDemension {
	public static void main(String []args) {
		int[][] arr = {{1,2,3,},{33,45,77},{44,66,88,0,22}};
		//遍历
		for(int i = 0; i < arr.length; i++){ //遍历二维数组，遍历出来的每一个元素是一个一维数组
			for(int j = 0; j < arr[i].length; j++){ //遍历对应位置上的一维数组
			System.out.println(arr[i][j]);
			}
			System.out.println("---------");
			}
		System.out.println("---------------------------------");
		
		//头尾交换
		for(int start = 0, end = arr.length -1; start < end; start++,end--){
			int[] temp = arr[start];
			arr[start] = arr[end];
			arr[end] = temp;
		}
		for(int i = 0; i < arr.length; i++){ //遍历二维数组，遍历出来的每一个元素是一个一维数组
			for(int j = 0; j < arr[i].length; j++){ //遍历对应位置上的一维数组
			System.out.println(arr[i][j]);
			}
			System.out.println("---------");
			}
	}
}

Exercise:

import java.util.Scanner;
/*
 * 从控制台输入行数，打印对应的杨辉三角
 */

public class Exercise {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		System.out.println("please enter the number of row: ");
		int row = s.nextInt();
		//根据行数定义好二维数组，由于每一行的元素个数不同，所以不定义每一行的个数
		int[][] arr = new int[row][];
		//遍历二维数组
		for(int i = 0; i < row; i++){
		    //初始化每一行的这个一维数组
		    arr[i] = new int[i + 1];
		    //遍历这个一维数组，添加元素    
		    for(int j = 0; j <= i; j++){
		        //每一列的开头和结尾元素为1，开头的时候，j=0，结尾的时候，j=i
		        if(j == 0 || j == i){
		            arr[i][j] = 1;
		        } else {//每一个元素是它上一行的元素和斜对角元素之和
		            arr[i][j] = arr[i -1][j] + arr[i - 1][j - 1];
		        }
		        System.out.print(arr[i][j] + "\t");
		    }
		    System.out.println();
		}
	}
}

Date：2020-06-03
CodeLion