mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 2215,
|
||||
"likes": 2219,
|
||||
"dislikes": 69,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Longest Substring Without Repeating Characters\", \"titleSlug\": \"longest-substring-without-repeating-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Substring with At Most Two Distinct Characters\", \"titleSlug\": \"longest-substring-with-at-most-two-distinct-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Subarrays with K Different Integers\", \"titleSlug\": \"subarrays-with-k-different-integers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Max Consecutive Ones III\", \"titleSlug\": \"max-consecutive-ones-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximize the Confusion of an Exam\", \"titleSlug\": \"maximize-the-confusion-of-an-exam\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"266.9K\", \"totalSubmission\": \"565K\", \"totalAcceptedRaw\": 266934, \"totalSubmissionRaw\": 565041, \"acRate\": \"47.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"267.3K\", \"totalSubmission\": \"565.7K\", \"totalAcceptedRaw\": 267327, \"totalSubmissionRaw\": 565714, \"acRate\": \"47.3%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "701",
|
||||
|
Reference in New Issue
Block a user