coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/minimum-operations-to-make-a-uni-value-grid.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"15.9K\", \"totalAcceptedRaw\": 6940, \"totalSubmissionRaw\": 15875, \"acRate\": \"43.7%\"}",
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"15.9K\", \"totalAcceptedRaw\": 6941, \"totalSubmissionRaw\": 15876, \"acRate\": \"43.7%\"}",
"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?",