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-seconds-to-equalize-a-circular-array.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"53.6K\", \"totalAcceptedRaw\": 13808, \"totalSubmissionRaw\": 53596, \"acRate\": \"25.8%\"}",
"stats": "{\"totalAccepted\": \"13.8K\", \"totalSubmission\": \"53.6K\", \"totalAcceptedRaw\": 13817, \"totalSubmissionRaw\": 53622, \"acRate\": \"25.8%\"}",
"hints": [
"For every possible x - the final value of the array, calculate the number of seconds needed to make all elements equal to x.",
"Notice that if you take two consecutive occurrences (i, j) of x, then the number of operations to make segment [i + 1, j - 1] equal to x is floor((j - i) / 2)"