coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/the-masseuse-lcci.json
View File

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