mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 00:41:42 +08:00
update
This commit is contained in:
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"127.4K\", \"totalSubmission\": \"206.8K\", \"totalAcceptedRaw\": 127424, \"totalSubmissionRaw\": 206813, \"acRate\": \"61.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"127.5K\", \"totalSubmission\": \"206.9K\", \"totalAcceptedRaw\": 127463, \"totalSubmissionRaw\": 206868, \"acRate\": \"61.6%\"}",
|
||||
"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