摘要: https://leetcode.cn/problems/longest-increasing-subsequence/?envType=study-plan-v2&envId=top-interview-150 class Solution: def lengthOfLIS(self, nums: 阅读全文
posted @ 2024-04-26 14:19 peterzh6 阅读(6) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.cn/problems/coin-change/description/?envType=study-plan-v2&envId=top-interview-150 class Solution: def coinChange(self, coins: List[i 阅读全文
posted @ 2024-04-26 02:12 peterzh6 阅读(3) 评论(0) 推荐(0) 编辑