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/originData/uncrossed-lines.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"148.8K\", \"totalSubmission\": \"237.7K\", \"totalAcceptedRaw\": 148797, \"totalSubmissionRaw\": 237657, \"acRate\": \"62.6%\"}",
"stats": "{\"totalAccepted\": \"148.8K\", \"totalSubmission\": \"237.7K\", \"totalAcceptedRaw\": 148803, \"totalSubmissionRaw\": 237663, \"acRate\": \"62.6%\"}",
"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?"
],