随笔分类 -  典型算法题-动态规划

摘要:https://leetcode.com/problems/triangle/?envType=study-plan-v2&envId=top-interview-150 题目解答: https://leetcode.cn/problems/IlPe0q/solutions/1036365/san- 阅读全文
posted @ 2023-11-19 11:17 guoyu1 阅读(9) 评论(0) 推荐(0) 编辑
摘要:5. 最长回文子串 package 动态规划; public class 最长回文子串 { public static void main(String[] args) { String s = "aaaa"; 最长回文子串 o = new 最长回文子串(); System.out.println( 阅读全文
posted @ 2021-11-29 21:32 guoyu1 阅读(31) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示