mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
添加392.判断子序列(动态规划)-JavaScript版
This commit is contained in:
@ -180,7 +180,30 @@ class Solution:
|
||||
return False
|
||||
```
|
||||
|
||||
Go:
|
||||
JavaScript:
|
||||
|
||||
```javascript
|
||||
const isSubsequence = (s, t) => {
|
||||
// s、t的长度
|
||||
const [m, n] = [s.length, t.length];
|
||||
// dp全初始化为0
|
||||
const dp = new Array(m + 1).fill(0).map(x => new Array(n + 1).fill(0));
|
||||
for (let i = 1; i <= m; i++) {
|
||||
for (let j = 1; j <= n; j++) {
|
||||
// 更新dp[i][j],两种情况
|
||||
if (s[i - 1] === t[j - 1]) {
|
||||
dp[i][j] = dp[i - 1][j - 1] + 1;
|
||||
} else {
|
||||
dp[i][j] = dp[i][j - 1];
|
||||
}
|
||||
}
|
||||
}
|
||||
// 遍历结束,判断dp右下角的数是否等于s的长度
|
||||
return dp[m][n] === m ? true : false;
|
||||
};
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user