几个基本算法

in 默认分类 with 0 comment

1,求最大值

int[] arr = new int[] {4,2,7,1,3,5};

     int max = arr[0];
     for(int i = 0; i < arr.length; i++) {
         if(max < arr[i]) {
             max = arr[i];
         }
     }
     System.out.println(max);

2,求最小值

int[] arr = new int[] {4,2,7,1,3,5};

     int max = arr[0];
     for(int i = 0; i < arr.length; i++) {
         if(max > arr[i]) {
             max = arr[i];
         }
     }
     System.out.println(max);
     

3,总和,平均数
int[] arr = new int[] {4,2,7,1,3,5};
int res = 0;

     for(int i = 0; i < arr.length; i++) {
         res += arr[i];
     }
     System.out.println("总和是:"+ res);
     System.out.println("平均数是:" + res/arr.length);

4,数组复制
int[] copy = new int[arr.length];//声明一个与arr长度一致的数组

     for(int i = 0; i < arr.length; i++) {
         copy[i] = arr[i];
     }

5,数组反转
int[] temp = new int[arr.length];

     int k = 0;
     for(int i = arr.length - 1; i >= 0; i--) {
         temp[k] = arr[i];
         k++;
     }
     
     arr = temp;
     for(int i = 0; i < arr.length; i++) {
         System.out.println(arr[i]);
     }

6,冒泡排序

int[] arr = new int[] {4,7,3,1};

     int temp = 0;
     for(int i = 0; i < arr.length; i++) {
         for(int j = 0; j < arr.length - 1 -i; j++) {
             if(arr[j] > arr[j + 1]) {
                 temp = arr[j];
                 arr[j] = arr[j + 1];
                 arr[j + 1] = temp;
             }
         }
     }
     
     for(int i = 0; i < arr.length; i++) {
         System.out.println(arr[i]);
     }















Comments are closed.