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:
小墨
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/originData/max-dot-product-of-two-subsequences.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"75K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 75003, \"totalSubmissionRaw\": 119712, \"acRate\": \"62.7%\"}",
"stats": "{\"totalAccepted\": \"75K\", \"totalSubmission\": \"119.7K\", \"totalAcceptedRaw\": 75008, \"totalSubmissionRaw\": 119720, \"acRate\": \"62.7%\"}",
"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."
],