ACM输入模式-输入多行数组

最新推荐文章于 2023-09-12 20:06:14 发布

Halucas在学习

最新推荐文章于 2023-09-12 20:06:14 发布

阅读量493

点赞数 1

文章标签： java 算法

本文链接：https://blog.csdn.net/weixin_44574905/article/details/126414544

版权

//输入用逗号隔开
//1,2,3,4
//4,3,2,1
package ACM_Exercise;
import java.util.Scanner;

/**
 * @author Halu
 * @create 2022-08-18 21:46
 */
public class twoLineArr {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String input1 = in.nextLine();
        String input2 = in.nextLine();
        String[] strArrA = input1.split(",");
        String[] strArrB = input2.split(",");

        int[] A = new int[strArrA.length];
        int[] B = new int[strArrB.length];
        for (int i=0; i<A.length; i++){
            A[i] = Integer.parseInt(strArrA[i]);
        }
        for (int i=0; i<B.length; i++){
            B[i] = Integer.parseInt(strArrB[i]);
        }

        System.out.println(tellOrder(A,B));
    }

    public static boolean tellOrder(int[] A, int[] B){
        if (A.length!=B.length) return false;
        int j = B.length-1;
        for (int i = 0; i <B.length ; i++) {
            if (A[i]!=B[j]) return false;
            j--;
        }
        return true;
    }
}


//输入的是两行带括号的数组
//[1,2,3,4]
//[4,3,2,1]
public class twoLineArr {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String input1 = in.nextLine();
        String input2 = in.nextLine();
        String[] strArrA = input1.split(",");
        String[] strArrB = input2.split(",");

        int[] A = new int[strArrA.length];
        int[] B = new int[strArrB.length];
        for (int i=1; i<A.length-1; i++){
            A[i] = Integer.parseInt(strArrA[i]);
        }
        for (int i=1; i<B.length-1; i++){
            B[i] = Integer.parseInt(strArrB[i]);
        }

        System.out.println(tellOrder(A,B));
    }

    public static boolean tellOrder(int[] A, int[] B){
        if (A.length!=B.length) return false;
        int j = B.length-1;
        for (int i = 0; i <B.length ; i++) {
            if (A[i]!=B[j]) return false;
            j--;
        }
        return true;
    }
}