Java学习第13天-CSDN博客

本文链接：https://blog.csdn.net/weixin_47908586/article/details/126047993

冒泡排序：

/*
* 数组的冒泡排序
*
*
*/
public class BubbleSort {
   public static void main(String[] args) {
       int[] arr = new int[] {43,32,76,-98,0,64,33,-21,32,99};

       //冒泡排序

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

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

               if(arr[j] > arr[j + 1]) {
                   int temp = arr[j];
                   arr[j] = arr[j + 1];
                   arr[j + 1] = temp;
               }

           }

       }

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

       }

   }
}

/*
* 1.使用冒泡排序，实现如下的数组从小到大排序：
* 34,5,22,-98,6,-76,0,3
*
* 2.反转上面的数组
*
* 3.复制上面的数组
*
* 4.使用线性查找22
*

*5.数组中常见的异常
*/
public class maopaoTest {
   public static void main(String[] args) {
       int[] arr = new int[] {34,5,22,-98,6,-76,0,3};

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

           }

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

       //反转数组上面的
       System.out.println();
       for (int i = 0,j = arr.length - 1; i < j ; i++,j--) {
           int temp1 = 0;
           temp1 = arr[i];
           arr[i] = arr[j];
           arr[j] = temp1;

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

       }
       System.out.println();
       //数组的复制
       int[] arr1 = new int[arr.length];
       for (int i = 0; i < arr1.length; i++) {
           arr1[i] = arr[i];

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

       }
       System.out.println();
       //线性查找22
       int dest = 22;
       boolean isFlag = true;
       for (int i = 0; i < arr1.length; i++) {
           if(dest == arr[i]) {
               System.out.println(i);
               isFlag = false;
               break;
           }

       }
       if(isFlag) {
           System.out.println("不好意思，没找到哦");
       }

}
}
5.

/*
* 数组中的常见异常
* 1.数组角标越界：ArrayIndexOutBoundsException
*
* 2.空指针异常：NullPointerException
*
*
*
*
*/
public class ArrayExcptionTest {
   public static void main(String[] args) {

       //1.数组角标越界：ArrayIndexOutBoundsException
       int[] arr = new int[] {1,2,3,4,5};

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

//       }
//           System.out.println(arr[-2]);
//
//           System.out.println("Hello");

       //2.空指针异常：NullPointerException
       //情况1：
//       int[] arr1 = new int[] {1,2,3};
//       arr1 = null;
//       System.out.println(arr1[0]);

       //情况2：
//       int[][] arr2 = new int[4][];
//       System.out.println(arr2[0][0]);

       //情况3：
// String[] arr3 = new String[] {"AA","BB","CC"};
// arr3[0] = null;
// System.out.println(arr3[0].toString());



   }
}