coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/originData/minimum-operations-to-make-all-array-elements-equal.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 14840, \"totalSubmissionRaw\": 42854, \"acRate\": \"34.6%\"}",
"stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"42.9K\", \"totalAcceptedRaw\": 14846, \"totalSubmissionRaw\": 42865, \"acRate\": \"34.6%\"}",
"hints": [
"For each query, you should decrease all elements greater than queries[i] and increase all elements less than queries[i].",
"The answer is the sum of absolute differences between queries[i] and every element of the array. How do you calculate that optimally?"