coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/find-the-middle-index-in-array.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 373,
"likes": 398,
"dislikes": 18,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Pivot Index\", \"titleSlug\": \"find-pivot-index\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Partition Array Into Three Parts With Equal Sum\", \"titleSlug\": \"partition-array-into-three-parts-with-equal-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Find Pivot Index\", \"titleSlug\": \"find-pivot-index\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Partition Array Into Three Parts With Equal Sum\", \"titleSlug\": \"partition-array-into-three-parts-with-equal-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Maximum Sum Score of Array\", \"titleSlug\": \"maximum-sum-score-of-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,3,-1,8,4]\n[1,-1,4]\n[2,5]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"37.4K\", \"totalAcceptedRaw\": 24824, \"totalSubmissionRaw\": 37436, \"acRate\": \"66.3%\"}",
"stats": "{\"totalAccepted\": \"26.6K\", \"totalSubmission\": \"40.2K\", \"totalAcceptedRaw\": 26599, \"totalSubmissionRaw\": 40209, \"acRate\": \"66.2%\"}",
"hints": [
"Could we go from left to right and check to see if an index is a middle index?",
"Do we need to sum every number to the left and right of an index each time?",