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/sum-of-mutated-array-closest-to-target.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"31.8K\", \"totalSubmission\": \"67.8K\", \"totalAcceptedRaw\": 31757, \"totalSubmissionRaw\": 67767, \"acRate\": \"46.9%\"}",
"stats": "{\"totalAccepted\": \"31.8K\", \"totalSubmission\": \"67.8K\", \"totalAcceptedRaw\": 31760, \"totalSubmissionRaw\": 67771, \"acRate\": \"46.9%\"}",
"hints": [
"If you draw a graph with the value on one axis and the absolute difference between the target and the array sum, what will you get?",
"That graph is uni-modal.",