coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11: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

2
leetcode/originData/[no content]choose-numbers-from-two-arrays-in-range.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"409\", \"totalSubmission\": \"766\", \"totalAcceptedRaw\": 409, \"totalSubmissionRaw\": 766, \"acRate\": \"53.4%\"}",
"stats": "{\"totalAccepted\": \"410\", \"totalSubmission\": \"767\", \"totalAcceptedRaw\": 410, \"totalSubmissionRaw\": 767, \"acRate\": \"53.5%\"}",
"hints": [
"If you know the possible sums you can get for a range [l, r], how can you use this information to calculate the possible sums you can get for a range [l, r + 1]?",
"For the range [l, r], if it is possible to choose elements such that the sum of elements you picked from nums1 is x and the sum of elements you picked from nums2 is y, then (x + nums1[r + 1], y) and (x, y + nums2[r + 1]) are possible sums you can get in the range [l, r + 1].",