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

4
leetcode/originData/find-the-minimum-possible-sum-of-a-beautiful-array.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 277,
"likes": 278,
"dislikes": 38,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"70.9K\", \"totalAcceptedRaw\": 28915, \"totalSubmissionRaw\": 70879, \"acRate\": \"40.8%\"}",
"stats": "{\"totalAccepted\": \"28.9K\", \"totalSubmission\": \"70.9K\", \"totalAcceptedRaw\": 28916, \"totalSubmissionRaw\": 70896, \"acRate\": \"40.8%\"}",
"hints": [
"<div class=\"_1l1MA\">Greedily try to add the smallest possible number in the array <code>nums</code>, such that <code>nums</code> contains distinct positive integers, and there are no two indices <code>i</code> and <code>j</code> with <code>nums[i] + nums[j] == target</code>.</div>"
],