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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"13.6K\", \"totalAcceptedRaw\": 6064, \"totalSubmissionRaw\": 13572, \"acRate\": \"44.7%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"13.8K\", \"totalAcceptedRaw\": 6174, \"totalSubmissionRaw\": 13772, \"acRate\": \"44.8%\"}",
"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."
],