coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/max-dot-product-of-two-subsequences.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"18.4K\", \"totalAcceptedRaw\": 8818, \"totalSubmissionRaw\": 18358, \"acRate\": \"48.0%\"}",
"stats": "{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"18.4K\", \"totalAcceptedRaw\": 8820, \"totalSubmissionRaw\": 18360, \"acRate\": \"48.0%\"}",
"hints": [
"Use dynamic programming, define DP[i][j] as the maximum dot product of two subsequences starting in the position i of nums1 and position j of nums2."
],