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:
小墨
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/the-time-when-the-network-becomes-idle.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 253,
"dislikes": 17,
"likes": 269,
"dislikes": 18,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Network Delay Time\", \"titleSlug\": \"network-delay-time\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"N-ary Tree Level Order Traversal\", \"titleSlug\": \"n-ary-tree-level-order-traversal\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Depth of N-ary Tree\", \"titleSlug\": \"maximum-depth-of-n-ary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[[0,1],[1,2]]\n[0,2,1]\n[[0,1],[0,2],[1,2]]\n[0,10,10]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"12.6K\", \"totalAcceptedRaw\": 6178, \"totalSubmissionRaw\": 12591, \"acRate\": \"49.1%\"}",
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"13.1K\", \"totalAcceptedRaw\": 6459, \"totalSubmissionRaw\": 13140, \"acRate\": \"49.2%\"}",
"hints": [
"What method can you use to find the shortest time taken for a message from a data server to reach the master server? How can you use this value and the server's patience value to determine the time at which the server sends its last message?",
"What is the time when the last message sent from a server gets back to the server?",