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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 399,
"dislikes": 7,
"likes": 410,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[5,1,3]\n[9,4,2,3,4]\n[6,4,8,1,3,2]\n[4,7,6,2,3,8,6,1]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"14.2K\", \"totalAcceptedRaw\": 6924, \"totalSubmissionRaw\": 14178, \"acRate\": \"48.8%\"}",
"stats": "{\"totalAccepted\": \"7.1K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 7121, \"totalSubmissionRaw\": 14570, \"acRate\": \"48.9%\"}",
"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.",