coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 18121, \"totalSubmissionRaw\": 20251, \"acRate\": \"89.5%\"}",
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 18122, \"totalSubmissionRaw\": 20252, \"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?"