coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

4
leetcode/originData/[no content]palindrome-removal.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 268,
"likes": 273,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"8.7K\", \"totalSubmission\": \"19K\", \"totalAcceptedRaw\": 8723, \"totalSubmissionRaw\": 19031, \"acRate\": \"45.8%\"}",
"stats": "{\"totalAccepted\": \"8.9K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 8874, \"totalSubmissionRaw\": 19368, \"acRate\": \"45.8%\"}",
"hints": [
"Use dynamic programming.",
"Let dp[i][j] be the solution for the sub-array from index i to index j.",