coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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-cn/originData/[no content]widest-pair-of-indices-with-equal-range-sum.json
View File

@@ -21,7 +21,7 @@
"topicTags": [],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"112\", \"totalSubmission\": \"210\", \"totalAcceptedRaw\": 112, \"totalSubmissionRaw\": 210, \"acRate\": \"53.3%\"}",
"stats": "{\"totalAccepted\": \"124\", \"totalSubmission\": \"238\", \"totalAcceptedRaw\": 124, \"totalSubmissionRaw\": 238, \"acRate\": \"52.1%\"}",
"hints": [
"Keep prefix sums of both arrays.",
"Can the difference between the prefix sums at an index help us?",
@@ -30,7 +30,7 @@
],
"solution": null,
"status": null,
"sampleTestCase": "[1,1,0,1]\n[0,1,1,0]",
"sampleTestCase": "[0,0,2,2]",
"metaData": "{\n \"name\": \"widestPairOfIndices\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
"judgerAvailable": true,
"judgeType": "large",
@@ -44,7 +44,7 @@
"editorType": "CKEDITOR",
"ugcQuestionId": null,
"style": "LEETCODE",
"exampleTestcases": "[1,1,0,1]\n[0,1,1,0]\n[0,1]\n[1,1]\n[0]\n[1]",
"exampleTestcases": "[1,1,0,1]\n[0,1,1,0]\n[0,1]",
"__typename": "QuestionNode"
}
}