coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +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

4
leetcode/originData/construct-target-array-with-multiple-sums.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 634,
"likes": 643,
"dislikes": 73,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"80.8K\", \"totalAcceptedRaw\": 25193, \"totalSubmissionRaw\": 80757, \"acRate\": \"31.2%\"}",
"stats": "{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"81.2K\", \"totalAcceptedRaw\": 25320, \"totalSubmissionRaw\": 81200, \"acRate\": \"31.2%\"}",
"hints": [
"Given that the sum is strictly increasing, the largest element in the target must be formed in the last step by adding the total sum in the previous step. Thus, we can simulate the process in a reversed way.",
"Subtract the largest with the rest of the array, and put the new element into the array. Repeat until all elements become one"