随笔分类 - 典型算法题-动态规划
摘要:https://leetcode.com/problems/triangle/?envType=study-plan-v2&envId=top-interview-150 题目解答: https://leetcode.cn/problems/IlPe0q/solutions/1036365/san-
阅读全文
摘要:5. 最长回文子串 package 动态规划; public class 最长回文子串 { public static void main(String[] args) { String s = "aaaa"; 最长回文子串 o = new 最长回文子串(); System.out.println(
阅读全文