coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimize-maximum-pair-sum-in-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 591,
"dislikes": 151,
"likes": 595,
"dislikes": 152,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,5,2,3]\n[3,5,4,2,4,6]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"56.8K\", \"totalAcceptedRaw\": 45769, \"totalSubmissionRaw\": 56757, \"acRate\": \"80.6%\"}",
"stats": "{\"totalAccepted\": \"45.9K\", \"totalSubmission\": \"56.9K\", \"totalAcceptedRaw\": 45918, \"totalSubmissionRaw\": 56934, \"acRate\": \"80.7%\"}",
"hints": [
"Would sorting help find the optimal order?",
"Given a specific element, how would you minimize its specific pairwise sum?"