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/originData/[no content]count-pairs-in-two-arrays.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 72,
"likes": 78,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Max Value of Equation\", \"titleSlug\": \"max-value-of-equation\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Substrings That Begin and End With the Same Letter\", \"titleSlug\": \"substrings-that-begin-and-end-with-the-same-letter\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 1862, \"totalSubmissionRaw\": 3230, \"acRate\": \"57.6%\"}",
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 1996, \"totalSubmissionRaw\": 3442, \"acRate\": \"58.0%\"}",
"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.",