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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/airplane-seat-assignment-probability.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 353,
"dislikes": 644,
"likes": 366,
"dislikes": 662,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n2",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.5K\", \"totalSubmission\": \"38.3K\", \"totalAcceptedRaw\": 24538, \"totalSubmissionRaw\": 38314, \"acRate\": \"64.0%\"}",
"stats": "{\"totalAccepted\": \"25K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 24997, \"totalSubmissionRaw\": 38989, \"acRate\": \"64.1%\"}",
"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.",