mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"57.3K\", \"totalAcceptedRaw\": 37817, \"totalSubmissionRaw\": 57314, \"acRate\": \"66.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"37.8K\", \"totalSubmission\": \"57.3K\", \"totalAcceptedRaw\": 37818, \"totalSubmissionRaw\": 57315, \"acRate\": \"66.0%\"}",
|
||||
"hints": [
|
||||
"Let f(n) denote the probability of the n-th person getting correct seat in n-person case, then:\r\n\r\nf(1) = 1 (base case, trivial)\r\nf(2) = 1/2 (also trivial)",
|
||||
"Try to calculate f(3), f(4), and f(5) using the base cases. What if the value of them?\r\nf(i) for i >= 2 will also be 1/2.",
|
||||
|
Reference in New Issue
Block a user