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 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]count-pairs-in-two-arrays.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"485\", \"totalSubmission\": \"922\", \"totalAcceptedRaw\": 485, \"totalSubmissionRaw\": 922, \"acRate\": \"52.6%\"}",
"stats": "{\"totalAccepted\": \"490\", \"totalSubmission\": \"932\", \"totalAcceptedRaw\": 490, \"totalSubmissionRaw\": 932, \"acRate\": \"52.6%\"}",
"hints": [
"We can write it as nums1[i] - nums2[i] > nums2[j] - nums1[j] instead of nums1[i] + nums1[j] > nums2[i] + nums2[j].",
"Store nums1[idx] - nums2[idx] in a data structure.",