//方式1int[] a ={1,2,3};System.out.println("a:"+Arrays.toString(a));//方式2int[] b =newint[]{1,2,3};System.out.println("b:"+Arrays.toString(b));//方式3int[] c =newint[3];for(int i =0; i <c.length ; i++){
c[i]= i +1;}System.out.println("c:"+Arrays.toString(c));//方式4ArrayList<Integer> arr =newArrayList<Integer>();for(int i =0; i <3; i++){
arr.add(i+1);}System.out.println("arr:"+ arr.toString());
for(int i =0; i < c.length; i++){int current = c[i];System.out.println("下标为"+ i +"的元素为"+"current");}for(int i =0; i < arr.size(); i++){int current = arr.get(i);System.out.println("下标为"+ i +"的元素为"+"current");}
3.8查找某个元素
复杂度O(n)
for(int i =0; i < c.length; i++){if(c[i]==99){System.out.println("元素99的下标为"+ i);}}boolean find= arr.contains(99);System.out.println("元素99是否存在:"+ find);
3.9数组排序
c =newint[]{2,3,1};
arr =newArrayList<>();
arr.add(2);
arr.add(3);
arr.add(1);System.out.println("c:"+Arrays.toString(c));System.out.println("arr:"+ arr.toString());Arrays.sort(c);System.out.println("c:"+Arrays.toString(c));Collections.sort(arr);System.out.println("arr:"+ arr);Collections.sort(arr,Collections.reverseOrder());System.out.println("arr:"+ arr);