int [] arr=new int[5];
0: iconst_5
1: newarray int
3: astore_1
4: return
int [] arr1=new int[]{6,8,9,9}; == int [] arr2={6,8,9,9};
0: iconst_4
1: newarray int
3: dup
4: iconst_0
5: bipush 6
7: iastore
8: dup
9: iconst_1
10: bipush 8
12: iastore
13: dup
14: iconst_2
15: bipush 9
17: iastore
18: dup
19: iconst_3
20: bipush 9
22: iastore
23: astore_1
24: return
数组常用方法
Arrays.copyOf(arr1, arr1.length)
Arrays.fill(arr, 6)
Arrays.toString(arr) =StringUtils.join(Arrays.asList(arr), “,”) <->String.spilt(",")
Arrays.sort(arr1)<->ArrayUtils.reverse(arr1)逆序
Arrays.binarySearch(arr, 8) 先要 =Arrays.asList(arr).contains(“xxzzzz”);
Arrays.asList(arr1)<-> List.toArray(new String[list.size()])
Arrays.equals(a, a1)已重写比较内容
冒泡排序
int[] arr={5,3,8,3,4};
for(int i=0;i<arr.length;i++)
{
System.out.println("i="+i);
for (int j=0;j<arr.length-i-1;j++)
{
if(arr[j]>arr[j+1])
{
int temp=arr[j+1];
arr[j+1]=arr[j];
arr[j]=temp;
}
System.out.println("j="+j);
System.out.println(Arrays.toString(arr));
}
System.out.println("===========");
}
i=0
j=0
[3, 5, 8, 3, 4]
j=1
[3, 5, 8, 3, 4]
j=2
[3, 5, 3, 8, 4]
j=3
[3, 5, 3, 4, 8]
===========
i=1
j=0
[3, 5, 3, 4, 8]
j=1
[3, 3, 5, 4, 8]
j=2
[3, 3, 4, 5, 8]
===========
i=2
j=0
[3, 3, 4, 5, 8]
j=1
[3, 3, 4, 5, 8]
===========
i=3
j=0
[3, 3, 4, 5, 8]
===========
i=4
===========
选择排序
int[] arr={5,3,8,3,4};
for(int i=0;i<arr.length;i++)
{ System.out.println("i="+i);
int lowIndex=i;
for(int j=i+1;j<arr.length;j++)
{
if(arr[j]<arr[lowIndex]){
lowIndex=j;
}
}
System.out.println("lowIndex="+lowIndex);
int temp=arr[i];
arr[i]=arr[lowIndex];
arr[lowIndex]=temp;
System.out.println(Arrays.toString(arr));
}
i=0
lowIndex=1
[3, 5, 8, 3, 4]
i=1
lowIndex=3
[3, 3, 8, 5, 4]
i=2
lowIndex=4
[3, 3, 4, 5, 8]
i=3
lowIndex=3
[3, 3, 4, 5, 8]
i=4
lowIndex=4
[3, 3, 4, 5, 8]