coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/maximum-distance-between-a-pair-of-values.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"86.8K\", \"totalAcceptedRaw\": 46355, \"totalSubmissionRaw\": 86810, \"acRate\": \"53.4%\"}",
"stats": "{\"totalAccepted\": \"46.4K\", \"totalSubmission\": \"86.8K\", \"totalAcceptedRaw\": 46358, \"totalSubmissionRaw\": 86815, \"acRate\": \"53.4%\"}",
"hints": [
"Since both arrays are sorted in a non-increasing way this means that for each value in the first array. We can find the farthest value smaller than it using binary search.",
"There is another solution using a two pointers approach since the first array is non-increasing the farthest j such that nums2[j] ≥ nums1[i] is at least as far as the farthest j such that nums2[j] ≥ nums1[i-1]"