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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/longest-well-performing-interval.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 930,
"dislikes": 94,
"likes": 934,
"dislikes": 95,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[9,9,6,0,6,6,9]\n[6,6,6]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"62.1K\", \"totalAcceptedRaw\": 21254, \"totalSubmissionRaw\": 62147, \"acRate\": \"34.2%\"}",
"stats": "{\"totalAccepted\": \"21.3K\", \"totalSubmission\": \"62.2K\", \"totalAcceptedRaw\": 21277, \"totalSubmissionRaw\": 62233, \"acRate\": \"34.2%\"}",
"hints": [
"Make a new array A of +1/-1s corresponding to if hours[i] is > 8 or not. The goal is to find the longest subarray with positive sum.",
"Using prefix sums (PrefixSum[i+1] = A[0] + A[1] + ... + A[i]), you need to find for each j, the smallest i < j with PrefixSum[i] + 1 == PrefixSum[j]."