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-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/[no content]toss-strange-coins.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 227,
"dislikes": 19,
"likes": 232,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[0.4]\n1\n[0.5,0.5,0.5,0.5,0.5]\n0",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"18.7K\", \"totalAcceptedRaw\": 9855, \"totalSubmissionRaw\": 18711, \"acRate\": \"52.7%\"}",
"stats": "{\"totalAccepted\": \"10.1K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 10073, \"totalSubmissionRaw\": 19123, \"acRate\": \"52.7%\"}",
"hints": [
"What about solving the problem with DP?",
"Use DP with two states dp[pos][cnt], where pos represents the pos-th coin and cnt is the number of heads seen so far.",