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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/sort-the-matrix-diagonally.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1563,
"dislikes": 176,
"likes": 1568,
"dislikes": 177,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[3,3,1,1],[2,2,1,2],[1,1,1,2]]\n[[11,25,66,1,69,7],[23,55,17,45,15,52],[75,31,36,44,58,8],[22,27,33,25,68,4],[84,28,14,11,5,50]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"81.6K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 81610, \"totalSubmissionRaw\": 100318, \"acRate\": \"81.4%\"}",
"stats": "{\"totalAccepted\": \"81.7K\", \"totalSubmission\": \"100.4K\", \"totalAcceptedRaw\": 81704, \"totalSubmissionRaw\": 100428, \"acRate\": \"81.4%\"}",
"hints": [
"Use a data structure to store all values of each diagonal.",
"How to index the data structure with the id of the diagonal?",