coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +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/maximum-distance-between-a-pair-of-values.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 11674, \"totalSubmissionRaw\": 17881, \"acRate\": \"65.3%\"}",
"stats": "{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"17.9K\", \"totalAcceptedRaw\": 11680, \"totalSubmissionRaw\": 17910, \"acRate\": \"65.2%\"}",
"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]"