54 lines
952 B
Markdown
54 lines
952 B
Markdown
|
## 题目一
|
||
|
1,3,5,7
|
||
|
2,4,6,13
|
||
|
3,9,14,14
|
||
|
右上,左下.
|
||
|
二分,并记录小于等于某个值的个数和最接近的数
|
||
|
## 题目四 StingST
|
||
|
给定两个字符串S和T
|
||
|
返回S的所有子序列中
|
||
|
有多少个子序列的字面值等于T
|
||
|
[1,1,2,2] [1,2]
|
||
|
样本对应模型 ,结尾位置是否使用
|
||
|
S T
|
||
|
自序列 前缀串
|
||
|
dp[i][j]:s只拿前i个字符串做子序列,有多少个子序列,字面值等于T的前j个字符的前缀串
|
||
|
|
||
|
## 题目五
|
||
|
给定一个字符串Str
|
||
|
返回Str的所有子序列中有多少不同的字面值
|
||
|
https://leetcode.com/problems/distinct-subsequences-ii/
|
||
|
1,2,3,1
|
||
|
第0个all为{""} 1
|
||
|
第1个all为{"",1}
|
||
|
第2个all为当前值加上上一个all {"",1,2,12}
|
||
|
第3个all为当前值加上上一个all {"",1,2,12,3,13,23,123}
|
||
|
如果出现相同值当前值减去上次以相同符号开始的集合的非空总数
|
||
|
{"",1,2,12,3,13,23,123, 1,11,21,121,31,131,231,1231}-{1}
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
mynachure
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|