【Java笔试强训】day18编程题

最新推荐文章于 2024-08-24 17:09:16 发布

摸鱼王胖嘟嘟

最新推荐文章于 2024-08-24 17:09:16 发布

阅读量137

点赞数 2

分类专栏：【Java笔试强训】48day 文章标签： java 开发语言

本文链接：https://blog.csdn.net/weixin_61341342/article/details/130042992

版权

【Java笔试强训】48day 专栏收录该内容

28 篇文章 1 订阅

订阅专栏

编程题

统计每个月兔子的总数

在这里插入图片描述

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));
        }
    }
}