coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/originData/number-of-ways-to-select-buildings.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"31.1K\", \"totalSubmission\": \"61.5K\", \"totalAcceptedRaw\": 31067, \"totalSubmissionRaw\": 61520, \"acRate\": \"50.5%\"}",
"stats": "{\"totalAccepted\": \"31.1K\", \"totalSubmission\": \"61.5K\", \"totalAcceptedRaw\": 31077, \"totalSubmissionRaw\": 61533, \"acRate\": \"50.5%\"}",
"hints": [
"There are only 2 valid patterns: ‘101’ and ‘010’. Think about how we can construct these 2 patterns from smaller patterns.",
"Count the number of subsequences of the form ‘01’ or ‘10’ first. Let n01[i] be the number of ‘01’ subsequences that exist in the prefix of s up to the ith building. How can you compute n01[i]?",