mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1410,
|
||||
"dislikes": 1752,
|
||||
"likes": 1412,
|
||||
"dislikes": 1751,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Flip Game II\", \"titleSlug\": \"flip-game-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Guess Number Higher or Lower\", \"titleSlug\": \"guess-number-higher-or-lower\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Can I Win\", \"titleSlug\": \"can-i-win\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find K Closest Elements\", \"titleSlug\": \"find-k-closest-elements\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "10\n1\n2",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"91.5K\", \"totalSubmission\": \"202.1K\", \"totalAcceptedRaw\": 91493, \"totalSubmissionRaw\": 202129, \"acRate\": \"45.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"91.5K\", \"totalSubmission\": \"202.2K\", \"totalAcceptedRaw\": 91542, \"totalSubmissionRaw\": 202211, \"acRate\": \"45.3%\"}",
|
||||
"hints": [
|
||||
"The best strategy to play the game is to minimize the maximum loss you could possibly face. Another strategy is to minimize the expected loss. Here, we are interested in the <b>first</b> scenario.",
|
||||
"Take a small example (n = 3). What do you end up paying in the worst case?",
|
||||
|
Reference in New Issue
Block a user