数组12.20

数组创建

//第1种动态初始化
        int[] ints = new int[1024];
        //第2种静态初始化
        int a[] = {0,1,2,3,4};

数组赋值

public class Array01 {
    public static void main(String[] args) {
        int[] ints = new int[10];
        for (int i = 0; i < ints.length; i++) {
            ints[i] = i;
            System.out.print(ints[i]+ " ");
        }
    }
}

数组拷贝

public class Array01 {
    public static void main(String[] args) {
        int[] ints = new int[10];
        int[] ints1 = new int[ints.length];
        for (int i = 0; i < ints.length; i++) {
            ints[i] = i;
            ints1[i] = ints[i];
            System.out.print(ints1[i]+ " ");
        }
    }
}

数组翻转

public class Array01 {
    public static void main(String[] args) {
        int[] ints = new int[10];
        int[] ints1 = new int[ints.length];
        for (int i = 0; i < ints.length; i++) {
            ints[i] = i;
        }
        for (int i = 0; i < ints1.length; i++) {
            ints1[i] = ints[ints.length-1-i];
            System.out.print(ints1[i] + " ");
        }
    }
}

数组扩容

import java.util.Scanner;

public class Array01 {
    public static void main(String[] args) {
        int []arr = {1,2,3};
        int []arrNew = null;
        Scanner scanner = null;
        while(true){
            scanner =  new Scanner(System.in);
            String c = scanner.next();
            if (c.equals("y")){
            arrNew = new int[arr.length+1];
            for (int i = 0; i < arr.length; i++) {
                arrNew[i] = arr[i];
                arrNew[i+1] = arr[i]+1;
            }
            arr=arrNew;
            for (int i : arr) {
                System.out.print(i + " ");
            }}

            if (c.equals("n")){
                for (int anInt : arr){
                    System.out.print(anInt + " ");
                }
                break;
            }
        }
    }
}

数组缩减

import java.util.Scanner;

public class Array01 {
    public static void main(String[] args) {
        int []arr = {1,2,3};
        int []arrNew = null;
        Scanner scanner = null;
        while(true){
            scanner =  new Scanner(System.in);
            String c = scanner.next();
            if (c.equals("y")){
            arrNew = new int[arr.length-1];
            for (int i = 0; i < arr.length-1; i++) {
                arrNew[i] = arr[i];
            }
            arr=arrNew;
            for (int i : arr) {
                System.out.print(i + " ");
            }
                System.out.println("ooo" + arr.length);
                if (arr.length==0) {
                    System.out.println("不能再缩减!!!");
                    return;
                }
            }
            else if (c.equals("n")){
                for (int anInt : arr){
                    System.out.print(anInt + " ");
                }
                break;
            }


        }
    }
}

数组冒泡排序

class a{
    public static void main(String[] args) {
        int[] ints = {3,2,3,4,23,89,4,5,45};
        int temp;
        for (int i = 0; i < ints.length; i++) {
            for (int j = i; j < ints.length-1; j++) {
                if (ints[i] > ints[j]){
                    temp = ints[i];
                    ints[i] = ints[j];
                    ints[j] = temp;
                }
            }
            System.out.print(ints[i] + " ");
        }
    }
}

二维数组创建

class a{
    public static void main(String[] args) {
        //动态创建
        int[][] ints = new int[4][];

        //静态创建
        int [][] a= {{123,2,4,7,8,9,7},{7,80,7},{697,8,7,8,9,798}};
        
    }
}

二维数组赋值

class a{
    public static void main(String[] args) {
        
        int[][] ints = new int[4][5];
        for (int i = 0; i < ints.length; i++) {
            for (int j = 0; j < ints[i].length; j++) {
                ints[i][j] = j;
            }
        }
        for (int i = 0; i < ints.length; i++) {
            for (int j = 0; j < ints[i].length; j++) {
                System.out.print(ints[i][j] + " ");
            }
        }
        

    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值