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/the-masseuse-lcci.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"81.2K\", \"totalSubmission\": \"158.5K\", \"totalAcceptedRaw\": 81199, \"totalSubmissionRaw\": 158547, \"acRate\": \"51.2%\"}",
"stats": "{\"totalAccepted\": \"81.2K\", \"totalSubmission\": \"158.6K\", \"totalAcceptedRaw\": 81204, \"totalSubmissionRaw\": 158563, \"acRate\": \"51.2%\"}",
"hints": [
"此题有递归和遍历两种解法，但从递归开始可能更容易一些。",
"递归解法：每个预约都有两个选择（接受预约或拒绝预约）。作为一种蛮力方法，你可以在所有可能性的地方递归。但是请注意，如果接收了预约请求i，那么你的递归算法应该跳过预约请求i + 1。",