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 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

6
leetcode/originData/find-the-distance-value-between-two-arrays.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 311,
"dislikes": 1185,
"likes": 313,
"dislikes": 1188,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[4,5,8]\n[10,9,1,8]\n2\n[1,4,2,3]\n[-4,-3,6,10,20,30]\n3\n[2,1,100,3]\n[-5,-2,10,-3,7]\n6",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"39K\", \"totalSubmission\": \"58.9K\", \"totalAcceptedRaw\": 38966, \"totalSubmissionRaw\": 58941, \"acRate\": \"66.1%\"}",
"stats": "{\"totalAccepted\": \"39K\", \"totalSubmission\": \"59.1K\", \"totalAcceptedRaw\": 39040, \"totalSubmissionRaw\": 59057, \"acRate\": \"66.1%\"}",
"hints": [
"Sort 'arr2' and use binary search to get the closest element for each 'arr1[i]', it gives a time complexity of O(nlogn)."
],