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

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

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 5,
"likes": 6,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"490\", \"totalSubmission\": \"932\", \"totalAcceptedRaw\": 490, \"totalSubmissionRaw\": 932, \"acRate\": \"52.6%\"}",
"stats": "{\"totalAccepted\": \"631\", \"totalSubmission\": \"1.1K\", \"totalAcceptedRaw\": 631, \"totalSubmissionRaw\": 1130, \"acRate\": \"55.8%\"}",
"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.",