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

6
leetcode/originData/maximal-network-rank.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 618,
"dislikes": 119,
"likes": 653,
"dislikes": 123,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "4\n[[0,1],[0,3],[1,2],[1,3]]\n5\n[[0,1],[0,3],[1,2],[1,3],[2,3],[2,4]]\n8\n[[0,1],[1,2],[2,3],[2,4],[5,6],[5,7]]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"36.5K\", \"totalSubmission\": \"64.7K\", \"totalAcceptedRaw\": 36527, \"totalSubmissionRaw\": 64736, \"acRate\": \"56.4%\"}",
"stats": "{\"totalAccepted\": \"38.1K\", \"totalSubmission\": \"67.1K\", \"totalAcceptedRaw\": 38109, \"totalSubmissionRaw\": 67119, \"acRate\": \"56.8%\"}",
"hints": [
"Try every pair of different cities and calculate its network rank.",
"The network rank of two vertices is <i>almost</i> the sum of their degrees.",