编程题

统计每个月兔子的总数

package tuzigeshu;

import java.util.Scanner;

@SuppressWarnings({
          
   "all"})
public class Main {
          
   
    public static void main(String[] args) {
          
   
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
          
   
            int m = sc.nextInt();
            System.out.println(num(m));
        }

    }

    public static int num(int m) {
          
   
        int first = 1;
        int second = 1;
        int num = 0;
        for (int i = 3; i <= m; i++) {
          
   
            num = first + second;
            first = second;
            second = num;
        }
        return num;
    }
}

字符串通配符

package zifuchuangtongpeifu;

import java.util.Scanner;

@SuppressWarnings({
          
   "all"})
public class Main {
          
   
    private static boolean match(String t, String s) {
          
   
        char[] ct = t.toCharArray();
        char[] cs = s.toCharArray();
        int lt = ct.length;
        int ls = cs.length;
        boolean[][] dp = new boolean[ls + 1][lt + 1];
        dp[0][0] = true;
        for (int i = 0; i <= ls; i++) {
          
   
            for (int j = 1; j <= lt; j++) {
          
   
                if (ct[j - 1] == *) {
          
   
                    if (i == 0) {
          
   
                        dp[i][j] = dp[i][j - 1];
                    } else {
          
   
                        if (cs[i - 1] == . || (cs[i - 1] >= A && cs[i - 1] <= Z) ||
                                (cs[i - 1] >= a && cs[i - 1] <= z) ||
                                (cs[i - 1] >= 0 && cs[i - 1] <= 9)) {
          
   
                            dp[i][j] = dp[i - 1][j] || dp[i][j - 1];
                        }
                    }
                } else {
          
   
                    if (i > 0 && defs(ct[j - 1], cs[i - 1])) {
          
   
                        dp[i][j] = dp[i - 1][j - 1];
                    }
                }
            }
        }
        return dp[ls][lt];
    }

    private static boolean defs(char t, char s) {
          
   
        if (t == ?) return true;
        if (t >= a && t <= z) {
          
   
            t = (char) (t - a + A);
        }
        if (s >= a && s <= z) {
          
   
            s = (char) (s - a + A);
        }
        return s == t;
    }

    public static void main(String[] args) {
          
   
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
          
   
            String t = sc.nextLine();
            String s = sc.nextLine();
            System.out.println(match(t, s));
        }
    }
}