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

6
leetcode/originData/maximum-matrix-sum.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 279,
"dislikes": 9,
"likes": 294,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,-1],[-1,1]]\n[[1,2,3],[-1,-2,-3],[1,2,3]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"21.7K\", \"totalAcceptedRaw\": 9663, \"totalSubmissionRaw\": 21692, \"acRate\": \"44.5%\"}",
"stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"22.2K\", \"totalAcceptedRaw\": 9943, \"totalSubmissionRaw\": 22213, \"acRate\": \"44.8%\"}",
"hints": [
"Try to use the operation so that each row has only one negative number.",
"If you have only one negative element you cannot convert it to positive."