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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/maximum-enemy-forts-that-can-be-captured.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 252,
"likes": 253,
"dislikes": 255,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Max Consecutive Ones\", \"titleSlug\": \"max-consecutive-ones\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Max Consecutive Ones III\", \"titleSlug\": \"max-consecutive-ones-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20K\", \"totalSubmission\": \"52.9K\", \"totalAcceptedRaw\": 20033, \"totalSubmissionRaw\": 52879, \"acRate\": \"37.9%\"}",
"stats": "{\"totalAccepted\": \"20.1K\", \"totalSubmission\": \"52.9K\", \"totalAcceptedRaw\": 20051, \"totalSubmissionRaw\": 52916, \"acRate\": \"37.9%\"}",
"hints": [
"For each fort under your command, check if you can move the army from here.",
"If yes, find the closest empty positions satisfying all criteria.",