coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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/maximum-points-in-an-archery-competition.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 221,
"dislikes": 18,
"likes": 248,
"dislikes": 21,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Product of the Length of Two Palindromic Subsequences\", \"titleSlug\": \"maximum-product-of-the-length-of-two-palindromic-subsequences\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "9\n[1,1,0,1,0,0,2,1,0,1,2,0]\n3\n[0,0,1,0,0,0,0,0,0,0,0,2]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"16.1K\", \"totalAcceptedRaw\": 7498, \"totalSubmissionRaw\": 16066, \"acRate\": \"46.7%\"}",
"stats": "{\"totalAccepted\": \"8.4K\", \"totalSubmission\": \"17.8K\", \"totalAcceptedRaw\": 8433, \"totalSubmissionRaw\": 17817, \"acRate\": \"47.3%\"}",
"hints": [
"To obtain points for some certain section x, what is the minimum number of arrows Bob must shoot?",
"Given the small number of sections, can we brute force which sections Bob wants to win?",