1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 384,
"likes": 387,
"dislikes": 19,
"isLiked": null,
"similarQuestions": "[]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46.2K\", \"totalSubmission\": \"56.9K\", \"totalAcceptedRaw\": 46232, \"totalSubmissionRaw\": 56892, \"acRate\": \"81.3%\"}",
"stats": "{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"57.1K\", \"totalAcceptedRaw\": 46390, \"totalSubmissionRaw\": 57080, \"acRate\": \"81.3%\"}",
"hints": [
"If you only had to find the maximum product of 2 numbers in an array, which 2 numbers should you choose?",
"We only need to worry about 4 numbers in the array."