自己写的ArrayTool功能较弱,在jdk中早就已经提供了,使用jdk中已经提供好的类型使用即可。Arrays。
fill(int[] arr, int val)
binarySearch(int[] arr, int key)
前提:数组本身是升序排列
效率:高于全部遍历
equals(int[] arr1, int[] arr2)
sort(int[] arr)
toString(int[] arr)
代码示例:
String[] str1={"1","2","3"};
String[] str2={"1","2",new String("3")};
System.out.println(Arrays.equals(str1, str2));//true
Arrays.toString(a)
使用二分搜索算法在指定的数组中搜索指定的值,并返回该值所在索引位置;若查询不到,则返回-1
代码示例:
char[] a={‘a‘,‘b‘,‘c‘,‘d‘,‘e‘};
int i = Arrays.binarySearch(a, ‘d‘);
System.out.println(i);//i=3
int[] a={1,2,3,6,8};
int[] b=Arrays.copyOf(a, a.length);
System.out.println(Arrays.toString(b));
String[] stringArray = { "o", "i", "u", "y", "t" };
ArrayList<String> arrayList = new
ArrayList<String>(Arrays.asList(stringArray));
String[] stringArray = { "a", "b", "c", "d", "e" };
boolean b = Arrays.asList(stringArray).contains("a"); //true
int[] Array = { 1, 2, 3, 4, 5 };
int[] Array2 = { 6, 7, 8, 9, 10 };
int[] Array3 = ArrayUtils.addAll(Array, Array2);
String[] Array = { "a", "b", "c", "d", "e" };
ArrayList<String> arrayList = new ArrayList<String>(Arrays.asList(Array));
String[] stringArr = new String[arrayList.size()];
arrayList.toArray(stringArr);
Set<String> set = new HashSet<String>(Arrays.asList(stringArray));
int[] intArray = { 1, 2, 3, 4, 5 };
ArrayUtils.reverse(intArray);
int[] intArray = { 1, 2, 3, 4, 5 };
int[] removed = ArrayUtils.removeElement(intArray, 3);//创建新的数组
byte[] bytes = ByteBuffer.allocate(4).putInt(8).array();
原文:https://www.cnblogs.com/chensStudy/p/12066844.html