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

4
leetcode/originData/[no content]minimize-product-sum-of-two-arrays.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 86,
"likes": 88,
"dislikes": 9,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Choose Numbers From Two Arrays in Range\", \"titleSlug\": \"choose-numbers-from-two-arrays-in-range\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 6050, \"totalSubmissionRaw\": 6760, \"acRate\": \"89.5%\"}",
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 6071, \"totalSubmissionRaw\": 6782, \"acRate\": \"89.5%\"}",
"hints": [
"Is there a particular way we should order the arrays such that the product sum is minimized?",
"Would you want to multiply two numbers that are closer to one another or further?"