coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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

4
leetcode/originData/maximum-running-time-of-n-computers.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 427,
"likes": 441,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Moves to Equal Array Elements\", \"titleSlug\": \"minimum-moves-to-equal-array-elements\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Sell Diminishing-Valued Colored Balls\", \"titleSlug\": \"sell-diminishing-valued-colored-balls\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Number of Tasks You Can Assign\", \"titleSlug\": \"maximum-number-of-tasks-you-can-assign\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Time to Complete Trips\", \"titleSlug\": \"minimum-time-to-complete-trips\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 7617, \"totalSubmissionRaw\": 20396, \"acRate\": \"37.3%\"}",
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"20.9K\", \"totalAcceptedRaw\": 7851, \"totalSubmissionRaw\": 20858, \"acRate\": \"37.6%\"}",
"hints": [
"For a given running time, can you determine if it is possible to run all n computers simultaneously?",
"Try to use Binary Search to find the maximal running time"