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/minimum-operations-to-make-a-subsequence.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 10506, \"totalSubmissionRaw\": 21772, \"acRate\": \"48.3%\"}",
"stats": "{\"totalAccepted\": \"10.5K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 10506, \"totalSubmissionRaw\": 21774, \"acRate\": \"48.3%\"}",
"hints": [
"The problem can be reduced to computing Longest Common Subsequence between both arrays.",
"Since one of the arrays has distinct elements, we can consider that these elements describe an arrangement of numbers, and we can replace each element in the other array with the index it appeared at in the first array.",