PAT 2020冬季乙级考试 Java实现

注意这一题是位数！！不是个位数，当时浪费了好长时间

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * @date 2021-9-7 - 14:01
 * Created by Salmon
 */
public class Main_2020_winter_1 {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(bufferedReader.readLine());
        String[] strings = bufferedReader.readLine().split("\\s+");
        for (int i = 0; i < n; i++) {
            if(strings[i].length() == 1){
                System.out.println("Yes");
            }else {
                    int num = Integer.parseInt(strings[i]);
                    int div = strings[i].length();
                    if(num % div == 0){
                        System.out.println("Yes");
                        continue;
                    }else {
                        System.out.println("No");
                    }
                }
            }
        bufferedReader.close();
    }
}

10个10个生成就完事了

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * @date 2021-9-7 - 14:02
 * Created by Salmon
 */
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(bufferedReader.readLine());
        bufferedReader.close();
        int low = 0;
        int high = 10;
        createFns(2, high);
        while (true) {
            if(num[high - 1] < n){
                low = low + 10;
                high = high + 10;
                createFns(low, high);
            }else {
                for (int i = low; i < high; i++) {
                    if(num[i] > n){
                        long res = (Math.abs(num[i] - n) < Math.abs(num[i - 1] - n)) ? num[i] : num[i - 1];
                        System.out.println(res);
                        break;
                    }
                }
                break;
            }
        }
    }

    static long[] num = new long[10000];
    public static void createFns(int low,int high){ //n：阶数
        num[0] = 0;
        num[1] = 1;
        for (int i = low; i < high; i++){
            num[i] = createFn(num[i - 2],num[i - 1]);
        }
    }

    public static long createFn(long n1,long n2){
        long n3 = n1 + n2;
        return n3;
    }

}

这PAT系统不知道有什么毛病，就是用java的话，如果把某一块代码分成多块代码并抽象出来作为多个函数，那么PAT判定时间越短- -

其他的要么超时，要么有几个测试点没过就不放出来丢人了