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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/pizza-with-3n-slices.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 519,
"likes": 520,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.8K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 7846, \"totalSubmissionRaw\": 16172, \"acRate\": \"48.5%\"}",
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 7865, \"totalSubmissionRaw\": 16195, \"acRate\": \"48.6%\"}",
"hints": [
"By studying the pattern of the operations, we can find out that the problem is equivalent to: Given an integer array with size 3N, select N integers with maximum sum and any selected integers are not next to each other in the array.",
"The first one in the array is considered next to the last one in the array. Use Dynamic Programming to solve it."