mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 1149,
|
||||
"likes": 1150,
|
||||
"dislikes": 65,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Two Sum\", \"titleSlug\": \"two-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"3Sum\", \"titleSlug\": \"3sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of Unequal Triplets in Array\", \"titleSlug\": \"number-of-unequal-triplets-in-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Maximum Value of an Ordered Triplet I\", \"titleSlug\": \"maximum-value-of-an-ordered-triplet-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Sum of Mountain Triplets I\", \"titleSlug\": \"minimum-sum-of-mountain-triplets-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"101K\", \"totalSubmission\": \"120.9K\", \"totalAcceptedRaw\": 100991, \"totalSubmissionRaw\": 120876, \"acRate\": \"83.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"101.1K\", \"totalSubmission\": \"121K\", \"totalAcceptedRaw\": 101060, \"totalSubmissionRaw\": 120952, \"acRate\": \"83.6%\"}",
|
||||
"hints": [
|
||||
"Are the constraints small enough for brute force?",
|
||||
"We can use three loops, each iterating through the array to go through every possible triplet. Be sure to not count duplicates."
|
||||
|
Reference in New Issue
Block a user