coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51: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/uncrossed-lines.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1595,
"likes": 1596,
"dislikes": 27,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Edit Distance\", \"titleSlug\": \"edit-distance\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"66.1K\", \"totalSubmission\": \"114.4K\", \"totalAcceptedRaw\": 66135, \"totalSubmissionRaw\": 114394, \"acRate\": \"57.8%\"}",
"stats": "{\"totalAccepted\": \"66.2K\", \"totalSubmission\": \"114.5K\", \"totalAcceptedRaw\": 66213, \"totalSubmissionRaw\": 114515, \"acRate\": \"57.8%\"}",
"hints": [
"Think dynamic programming. Given an oracle dp(i,j) that tells us how many lines A[i:], B[j:] [the sequence A[i], A[i+1], ... and B[j], B[j+1], ...] are uncrossed, can we write this as a recursion?"
],