第一次作业 乘法表和数组学习

import java.util.Arrays;
import java.util.Comparator;

/**
*

• @author 坤字土河车
• 综合

*/
public class TestWrite {

/*
public static void list(){
	int[] arr = {1,2,3,4,5};
	if(arr.length==0){
		System.out.println("null");
	  
	}
	int min=arr[0];
	int i;
	int p=0;
	for(i=0;i<arr.length;i++){
		if(min>arr[i]){
			min = arr[i];
			p=i;
		}
	}
	System.out.println(min+p);
	
}
*/

public static void multiplyList(){
	
	for(int i=9;i>=1;i--){
		for(int j=1;j<=i;j++){
			System.out.print(i+"x"+j+"="+i*j+" ");
		}
		System.out.println();
		
		}
	}

/* public static void bubbleSort(int[] arr){
if(arr.length==0){
return;
}
int temp;

	for(int i=0;i<arr.length-1;i++){
		for(int j=i+1;j<arr.length-i;j++){
			if(arr[j]>arr[j+1]){
				temp=arr[j];
				arr[j]=arr[j+1];
				arr[j+1]=temp;	
			}
		}
		
	}
	for(int k=0;k<arr.length;k++){
		System.out.print(arr[k]+" ");
}  
}
*/
//Arrays.sort(数组名称，
public static void bubblingSort(int[] nums) {   
	   System.out.println("排序之前的数据=====");
		for(int arr:nums){
			 System.out.print(arr+" ");
		}
		
	    int temp; // 记录临时中间值   
	    int size = nums.length; // 数组大小   
	    for (int i = 0; i < size - 1; i++) {   
	        for (int j = i + 1; j < size; j++) {   
	            if (nums[i] > nums[j]) { // 交换两数的位置   
	                temp = nums[i];   
	                nums[i] = nums[j];   
	                nums[j] = temp;   
	            }   
	        }   
	    } 
	    
	    System.out.println();
		System.out.println("排序之后的数据=====");
	    for(int arr:nums){
				System.out.print(arr+" ");
		}  
	}  

public static void paixu(int[] arr){
	if(arr.length==0){
		return;
	}
	int temp;
	int min=arr[0];
	int max=arr[0];
	int sum=0;
	for(int i=0;i<arr.length;i++){
		if(max<arr[i]){
			max = arr[i];
		}
		if(min>arr[i]){
			min = arr[i];	
		}
		
		
		sum=sum+arr[i];
		
	}
	System.out.println("最小值"+min);
	System.out.println("最大值"+max);
	System.out.println("和"+sum);
	System.out.println("大小值分界线=============");
}

// Arrays.sort排序
public static void sortt(){
Integer[] arr={12,34,34,324,34,323,2};
//从小到大
Arrays.sort(arr);
for (int x:arr) {
    System.out.print(x+" ");
}
System.out.println();
//从大到小
Arrays.sort(arr, new Comparator<Integer>() {
    @Override
    public int compare(Integer o1, Integer o2) {
        return o2.compareTo(o1);
    }
});
for (int x:arr) {
    System.out.print(x+" ");
}
System.out.println("sort方法分界线===================");
}

//数组复制
public static void copy(){
	 String[] arr=new String[5];
        String[] strs1={"123","234","345","456","789"};
        //String[] strs2=new String[2];//Two ways to state a array
        
        String[] str2=Arrays.copyOf(strs1, 3);
        String[] str3=Arrays.copyOf(strs1, 8);
        System.out.println();
        for(String ele:str2){
            System.out.print(ele+";");
            
        }
        System.out.println();
        for(String ele:str3){
            System.out.print(ele+";");
        }
 
        int[] in={1,2,3,4,5};
        int[] int1=Arrays.copyOf(in,3);
        int[] int2=Arrays.copyOf(in,8);
 
        System.out.println();
        for(int ele:int1){
            System.out.print(ele+";");
            
        }
        System.out.println();
        for(int ele:int2){
            System.out.print(ele+";");
            
        }
}


public static void main(String[] args) {
	// TODO 自动生成的方法存根
	//list();
	//multiplyList();
//	int[] nums={3,6,1,2,18,45,23,12};
//  bubblingSort(nums);
	
	int[] number={1789,2035,1899,1456,2013,1458,1254,1472,2365};
	String[] giao = {"java","c++","php","python","c","giao"};
//	paixu(number);
//	Arrays.toString(number);
	//System.out.println(Arrays.toString(number));
	//sortt();
	//copy();
	
	multiplyList();

	
}

}