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/count-the-hidden-sequences.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 350,
"dislikes": 38,
"likes": 357,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,-3,4]\n1\n6\n[3,-4,5,1,-2]\n-4\n5\n[4,-7,2]\n3\n6",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"31.5K\", \"totalAcceptedRaw\": 11049, \"totalSubmissionRaw\": 31522, \"acRate\": \"35.1%\"}",
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"32.5K\", \"totalAcceptedRaw\": 11418, \"totalSubmissionRaw\": 32462, \"acRate\": \"35.2%\"}",
"hints": [
"Fix the first element of the hidden sequence to any value x and ignore the given bounds. Notice that we can then determine all the other elements of the sequence by using the differences array.",
"We will also be able to determine the difference between the minimum and maximum elements of the sequence. Notice that the value of x does not affect this.",