mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 418,
|
||||
"dislikes": 10,
|
||||
"likes": 432,
|
||||
"dislikes": 12,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[[2,5,4],[1,5,1]]\n[[3,3,1],[8,5,2]]\n[[1,3,1,15],[1,3,3,1]]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"23.9K\", \"totalAcceptedRaw\": 9925, \"totalSubmissionRaw\": 23947, \"acRate\": \"41.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"10.2K\", \"totalSubmission\": \"24.5K\", \"totalAcceptedRaw\": 10183, \"totalSubmissionRaw\": 24529, \"acRate\": \"41.5%\"}",
|
||||
"hints": [
|
||||
"There are n choices for when the first robot moves to the second row.",
|
||||
"Can we use prefix sums to help solve this problem?"
|
||||
|
Reference in New Issue
Block a user