08-Arrays类（java.util.Arrays）

Arrays类（java.util.Arrays）

toString(打印数组元素)

package com.fenghuo.array;
​
import java.util.Arrays;
​
public class Demo5 {
    public static void main(String[] args) {
        int[] array = {1,45465,45,5656,48,12,3565,454};
        System.out.println(Arrays.toString(array));
    }
}
​
​
//
[1, 45465, 45, 5656, 48, 12, 3565, 454]

sort（排序）

package com.fenghuo.array;
​
import java.util.Arrays;
​
public class Demo5 {
    public static void main(String[] args) {
        int[] array = {1,45465,45,5656,48,12,3565,454};
        System.out.println(Arrays.toString(array));
        Arrays.sort(array);
        System.out.println(Arrays.toString(array));
    }
}
​
//
[1, 45465, 45, 5656, 48, 12, 3565, 454]
[1, 12, 45, 48, 454, 3565, 5656, 45465]

fill

package com.fenghuo.array;
​
import java.util.Arrays;
​
public class Demo5 {
    public static void main(String[] args) {
        int[] array = {1,45465,45,5656,48,12,3565,454};
        System.out.println(Arrays.toString(array));
        Arrays.sort(array);
        System.out.println(Arrays.toString(array));
        Arrays.fill(array,5);
        System.out.println(Arrays.toString(array));
        Arrays.fill(array,2,4,9);
        System.out.println(Arrays.toString(array));
    }
}
​
​
//
[1, 45465, 45, 5656, 48, 12, 3565, 454]
[1, 12, 45, 48, 454, 3565, 5656, 45465]
[5, 5, 5, 5, 5, 5, 5, 5]
[5, 5, 9, 9, 5, 5, 5, 5]

equals(判断两个数组是否相等)

package com.fenghuo.array;
​
import java.util.Arrays;
​
public class Demo5 {
    public static void main(String[] args) {
        int[] array = {1,45465,45,5656,48,12,3565,454};
        int[] array1 = {1,45465,45,5656,48,12,3565,454};
        System.out.println(Arrays.toString(array));
        Arrays.sort(array);
        System.out.println(Arrays.toString(array));
        Arrays.fill(array,5);
        System.out.println(Arrays.toString(array));
        Arrays.fill(array,2,4,9);
        System.out.println(Arrays.toString(array));
        System.out.println(Arrays.equals(array,array1));
​
    }
}
​
//
[1, 45465, 45, 5656, 48, 12, 3565, 454]
[1, 12, 45, 48, 454, 3565, 5656, 45465]
[5, 5, 5, 5, 5, 5, 5, 5]
[5, 5, 9, 9, 5, 5, 5, 5]
false

binarySearch（寻找数组下标）

//使用的时候需要先排序
package com.fenghuo.array;
​
import java.util.Arrays;
​
public class Demo5 {
    public static void main(String[] args) {
        int[] array = {1,45465,45,5656,48,12,3565,454};
        int[] array1 = {1,45465,45,5656,48,12,3565,454};
        System.out.println(Arrays.toString(array));
        Arrays.sort(array);
        System.out.println(Arrays.toString(array));
        Arrays.fill(array,5);
        System.out.println(Arrays.toString(array));
        Arrays.fill(array,2,4,9);
        System.out.println(Arrays.toString(array));
        System.out.println(Arrays.equals(array,array1));
        Arrays.sort(array1);
        System.out.println(Arrays.binarySearch(array1,12));
        System.out.println(Arrays.binarySearch(array1,555));
    }
}

冒泡排序

package com.fenghuo.array;
​
import java.util.Arrays;
​
public class Demo6 {
    public static void main(String[] args) {
        int[] nums = {321,32,4343,666,323};
        System.out.println(Arrays.toString(rank(nums)));
    }
    public static int[] rank(int[] nums){
        for (int i = 0; i < nums.length; i++) {
            for (int j = 0; j < nums.length-1; j++) {
                if(nums[j]>nums[j+1]){
                    int a ;
                    a = nums[j+1];
                    nums[j+1] = nums[j];
                    nums[j] = a;
                }
            }
        }
    return nums;
    }
}

稀疏数组