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:
小墨
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/originData/subsequence-with-the-minimum-score.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"19.6K\", \"totalAcceptedRaw\": 6105, \"totalSubmissionRaw\": 19617, \"acRate\": \"31.1%\"}",
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"19.6K\", \"totalAcceptedRaw\": 6105, \"totalSubmissionRaw\": 19619, \"acRate\": \"31.1%\"}",
"hints": [
"Maintain two pointers: i and j. We need to perform a similar operation: while t[0:i] + t[j:n] is not a subsequence of the string s, increase j.",
"We can check the condition greedily. Create the array leftmost[i] which denotes minimum index k, such that in prefix s[0:k] exists subsequence t[0:i]. Similarly, we define rightmost[i].",