mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"86.5K\", \"totalSubmission\": \"143K\", \"totalAcceptedRaw\": 86503, \"totalSubmissionRaw\": 142996, \"acRate\": \"60.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"86.6K\", \"totalSubmission\": \"143.2K\", \"totalAcceptedRaw\": 86604, \"totalSubmissionRaw\": 143162, \"acRate\": \"60.5%\"}",
|
||||
"hints": [
|
||||
"What if we have the array sorted?",
|
||||
"Loop the array and get the value A[i] then we need to find a value A[j] such that A[i] + A[j] < K which means A[j] < K - A[i]. In order to do that we can find that value with a binary search."
|
||||
|
Reference in New Issue
Block a user