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/minimum-operations-to-make-a-uni-value-grid.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 296,
"dislikes": 24,
"likes": 304,
"dislikes": 29,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Moves to Equal Array Elements II\", \"titleSlug\": \"minimum-moves-to-equal-array-elements-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[2,4],[6,8]]\n2\n[[1,5],[2,3]]\n1\n[[1,2],[3,4]]\n2",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.8K\", \"totalSubmission\": \"25.6K\", \"totalAcceptedRaw\": 12805, \"totalSubmissionRaw\": 25588, \"acRate\": \"50.0%\"}",
"stats": "{\"totalAccepted\": \"13.5K\", \"totalSubmission\": \"26.8K\", \"totalAcceptedRaw\": 13517, \"totalSubmissionRaw\": 26752, \"acRate\": \"50.5%\"}",
"hints": [
"Is it possible to make two integers a and b equal if they have different remainders dividing by x?",
"If it is possible, which number should you select to minimize the number of operations?",