coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/find-the-substring-with-maximum-cost.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 5669, \"totalSubmissionRaw\": 10131, \"acRate\": \"56.0%\"}",
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"10.1K\", \"totalAcceptedRaw\": 5672, \"totalSubmissionRaw\": 10135, \"acRate\": \"56.0%\"}",
"hints": [
"Create a new integer array where arr[i] denotes the value of character s[i].",
"We can use Kadane’s maximum subarray sum algorithm to find the maximum cost."