1
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
This commit is contained in:
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 149,
"dislikes": 549,
"dislikes": 551,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "4\n[[1,2,3],[3,2,0],[3,1,0],[1,2,0]]\n[[0,1],[2,3]]\n2\n[[1],[0]]\n[[1,0]]\n4\n[[1,3,2],[2,3,0],[1,3,0],[0,2,1]]\n[[1,3],[0,2]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 15657, \"totalSubmissionRaw\": 27166, \"acRate\": \"57.6%\"}",
"stats": "{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 15694, \"totalSubmissionRaw\": 27216, \"acRate\": \"57.7%\"}",
"hints": [
"Create a matrix “rank” where rank[i][j] holds how highly friend i' views j. This allows for O(1) comparisons between people"
],