coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-operations-to-make-a-subsequence.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 16517, \"totalSubmissionRaw\": 33376, \"acRate\": \"49.5%\"}",
"stats": "{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"33.4K\", \"totalAcceptedRaw\": 16531, \"totalSubmissionRaw\": 33409, \"acRate\": \"49.5%\"}",
"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.",