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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 561,
"likes": 562,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[]",
@@ -125,7 +125,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 16109, \"totalSubmissionRaw\": 35759, \"acRate\": \"45.0%\"}",
"stats": "{\"totalAccepted\": \"16.1K\", \"totalSubmission\": \"35.8K\", \"totalAcceptedRaw\": 16125, \"totalSubmissionRaw\": 35782, \"acRate\": \"45.1%\"}",
"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."
],