- 博客(9)
- 收藏
- 关注
RSS订阅原创 LeetCode LCR 085.括号生成 (Python3)
从 (...()...) 开始, 单向移动'(', 推出其他有效组合.套句老话, 不管白猫黑猫抓到老鼠就是好猫.有兴趣者可以试用非递归方法完成上述过程.
2025-01-15 14:13:28
121
原创 leetcode76. 最小覆盖子串 (Python3)
ssmap={}flag=0curlist=[]else:#process selse:else:else:flag+=1...>>>>>> s='a'>>> ss='a'['a']>>> s='a'[]>>>>>>>>>>>>
2024-10-24 14:37:16
369
原创 A General Two-Step Process for Longest Common Subsequence of String List (Python3)
step 1:step 2:return 0>>>... #... #... #... #... #...633>>>
2024-10-18 10:29:55
627
原创 LeetCode 300 -最长递增子序列
>>>>>...>>>>>> f(n)4>>> f(n)4>>> f(n)1>>> f(n)10>>> f(n)9>>>withasbeginend;t1 as (union allSQL>SQL> ed1 with3 as4 begin6 end;7 t1 as (14 )
2024-10-11 09:18:32
823
原创 leedcode 128. 最长连续序列（哈希）
maxcnt=0numsmap={}tmpcnt=1tmpnum=numtmpnum+=1tmpcnt+=1tmpnum=numtmpnum-=1tmpcnt+=1>>>>>> f(n)skip 2skip 4skip 5skip 3skip 7skip 1skip -1skip 97>>>
2024-10-09 07:58:40
151
原创 LeetCode 218 天际线问题 -revisit
union allunion allunion allunion allunion all。
2024-09-23 08:46:28
291
5
原创 Leetcode（135）——分发糖果
Browsed some problems and want to add some different thoughts on this specific one (skip descriptions).To make it as short as possible.1. Clearly there exists only 3 distinct patterns (-, /, \), each may occur 0 or more times.2. There exists one turning
2024-09-16 01:41:14
329
2
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人