杂记：一、Java几个小方法

说明

该文章只是记录了平时练习小程序的简单常用方法

取整数每位数字，返回数组

public static int[] getEveryNumber(int number) {
        int[] List = new int[100];
        int i=0;
        for(i=0; i<100 ;i++) {
            List[i] = -1;
        }

        for(i=0; true ;i++){
            if(number<10) {
                List[i] = number;
                break;
            }
            List[i] = number%10;
            number /= 10;
        }

        int[] Array = new int[i+1];
        copyArray(List, Array, i+1);
        transArray(Array);

        return Array;
    }

反转数组

public static void transArray(int[] Array) {
        for(int i=0; i<Array.length/2 ;i++) {
            int temp = Array[i];
            Array[i] = Array[Array.length-i-1];
            Array[Array.length-i-1] = temp;
        }
    }

冒泡排序

public static void sort(int[] achievement) {
        for(int i=1; i<achievement.length ;i++) {
            for(int j=0; j<achievement.length-i ;j++) {
                if(achievement[j]>achievement[j+1]) {
                    int temp = achievement[j];
                    achievement[j] = achievement[j+1];
                    achievement[j+1] = temp;
                }
            }
        }
    }

打印数组

public static void Print(int[] Array) {
        for(int i=0; i<Array.length ;i++) {
            System.out.print(Array[i] + "  ");
        }
        System.out.println();
    }

拷贝数组

public static void copyArray(int[] oldArray, int[] newArray, int length) {
        for(int i=0; i<length ;i++) {
            newArray[i] = oldArray[i];
        }
    }

判断该数是否在数组中

public static boolean inArray(int number, int[] Array) {
        for(int i=0; i<Array.length ;i++) {
            if(number == Array[i])
                return true;
        }
        return false;
    }