Java Arrays类API

String[] sh = {"guodegang" , "yuqian", "yueyunpeng", "zhanghelun","yuaaaadddd"};
System.out.println(Arrays.toString(sh));//[guodegang, yuqian, yueyunpeng, zhanghelun, yuaaaadddd]
System.out.println(sh.toString());//[Ljava.lang.String;@1b6d3586

//数组排序，parallelSort是并行排序，会把数组拆成子数组，数组越大，性能上优势越明显。
Arrays.sort(sh, 1, 3);//指定范围排序
System.out.println(Arrays.toString(sh));//[guodegang, yueyunpeng, yuqian, zhanghelun, yuaaaadddd]

Arrays.sort(sh);
System.out.println(Arrays.toString(sh));//[guodegang, yuaaaadddd, yueyunpeng, yuqian, zhanghelun]
Arrays.parallelSort(sh);
System.out.println(Arrays.toString(sh));//[guodegang, yuaaaadddd, yueyunpeng, yuqian, zhanghelun]

//二分查找法 ，查找 元素存在 的下标,不存在 返回 -插入点-1（前提排序）
System.out.println(Arrays.binarySearch(sh, "yuqian"));//3

//判断两个数组值是否相同,只能比较基本类型数组，对象数组不会值相等
int[] sh2 = {1 , 2, 3, 4, 5};
int[] sh3 = {1 , 2, 3, 4, 5};
int[] sh4 = {1 , 2, 3, 4};
System.out.println(Arrays.equals(sh2, sh3));//true
System.out.println(Arrays.equals(sh3, sh4));//false

//数组填充
Arrays.fill(sh, 1, 2, "222");//前算后不算,指定范围内填充
System.out.println(Arrays.toString(sh));//[guodegang, 222, yueyunpeng, yuqian, zhanghelun]
Arrays.fill(sh, "11111");
System.out.println(Arrays.toString(sh));//[11111, 11111, 11111, 11111, 11111]

//复制数组
String[] sh5 = {"guodegang" , "yuqian", "yueyunpeng", "zhanghelun","yuaaaadddd"};
String[] arrNew = Arrays.copyOfRange(sh5, 1, 3);//指定范围复制 算前不算厚
System.out.println(Arrays.toString(arrNew));//[yuqian, yueyunpeng]
String[] arrNew2 = Arrays.copyOf(sh5,4);//要复制的数组，个数
System.out.println(Arrays.toString(arrNew2));//[guodegang, yuqian, yueyunpeng, zhanghelun]