weixin_43919639的博客

PAT(Top Level) 1001 链接: https://pintia.cn/problem-sets/994805148990160896/problems/994805156657348608 1001 Battle Over Cities - Hard Version （35 分） It is vitally important to have all the cities conn...

动态规划——01背包 链接: https://pintia.cn/problem-sets/994805148990160896/problems/994805156145643520 1002 Business （35 分） As the manager of your company, you have to carefully consider, for each project, the...

LeetCode:5. longest Palindrom substring 第一种方法： Approach 4: Expand Around Center In fact, we could solve it in O(n^2)O(n 2 ) time using only constant space. We observe that a palindrome mirrors around ...

class Solution { public boolean isMatch(String text, String pattern) { if (pattern.isEmpty()) return text.isEmpty(); boolean first_match = (!text.isEmpty() && ...