2021-03-29

  • 依次输入五句话后逆序输出
/**
 * @kligfc
 * 2021/3/29
 */

import java.util.Scanner;

public class ReverseOutput {
    public static void main(String[] args) {
        String[] data_1 = new String[5];
        Scanner a = new Scanner(System.in);
        System.out.println("请输入" + data_1.length +"句话");
        for (int i = 0; i < data_1.length; i++) {
            System.out.println("请输入第" + (i+1) +"句话");
            data_1[i] = a.next();
        }
        System.out.println("逆序输出" + data_1.length +"句话");
        for (int j = 0; j < (data_1.length); j++) {
            System.out.println(data_1[data_1.length - (j+1)]);
        }
    }
}
  • 创建一个新数组,要求新数组是对原数组中的元素升序排序后所得,输出新数组中的元素
/**
 * @kligfc
 * 2021/3/29
 */
public class ArraySort {
    public static void main(String[] args) {
        int[] array = new int[]{1,3,-1,5,-2};
        int[] newArray = new  int[5];
        int a = 0;
        boolean b = false;
        System.out.println("原数组:");
        System.out.print("[");
        for (int k = 0; k < array.length; k++) {
            System.out.print(array[k] + " ");
        }
        System.out.println("]");
        System.out.println("排序后属组:");
        System.out.print("[");
        for (int i = 0; i < array.length - 1; i++) {
            for (int j = 0; j < array.length - 1; j++) {
                if (array[j] > array[j + 1]){
                    a = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = a;
                    b = true;
                }
            }
            if (b = false){
                break;
            }
        }
        for (int k = 0; k < array.length; k++) {
            newArray[k] = array[k];
        }
        for (int l = 0; l < array.length; l++) {
            System.out.print(newArray[l] + " ");
        }
        System.out.print("]");
    }
}
  • 用键盘输入10个数,合法数字为1、2、3,不是这三个数为非法数字,统计合法数字和非法数字的个数
/**
 * @kligfc
 * 2021/3/29
 */
import java.util.Scanner;

public class NumberOfStatistics {
    public static void main(String[] args) {
        int []number = new int[10];
        int secend;
        int tired;
        int a;
        int b;
        int first = secend = tired = a = b = 0;
        Scanner c = new Scanner(System.in);
        System.out.println("请输入" + number.length +"个数");
        for (int i = 0; i < number.length; i++) {
            number[i] =  c.nextInt();
            if (number[i] == 1){
                first += 1;
                a += 1;
            }
            if (number[i] == 2){
                secend += 1;
                a += 1;
            }
            if (number[i] == 3){
                tired += 1;
                a += 1;
            }
            if (number[i] != 1&&number[i] != 2&&number[i] != 3) {
                b += 1;
            }
        }
        System.out.println("输入的" + number.length +"个数为:");
        for (int j = 0; j < number.length; j++) {
            System.out.print(number[j] + " ");
        }
        System.out.println();
        System.out.println("数字1的个数为" + first);
        System.out.println("数字2的个数为" + secend);
        System.out.println("数字3的个数为" + tired);
        System.out.println("合法数字的个数为" + a);
        System.out.println("非法数字的个数为" + b);
    }
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值