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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"618\", \"totalSubmission\": \"716\", \"totalAcceptedRaw\": 618, \"totalSubmissionRaw\": 716, \"acRate\": \"86.3%\"}",
"stats": "{\"totalAccepted\": \"667\", \"totalSubmission\": \"776\", \"totalAcceptedRaw\": 667, \"totalSubmissionRaw\": 776, \"acRate\": \"86.0%\"}",
"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?"