We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 3fa6885 commit fff13ffCopy full SHA for fff13ff
solution/0000-0099/0035.Search Insert Position/Solution.php
@@ -1,18 +1,20 @@
1
class Solution {
2
/**
3
- * @param integer[] $nums
4
- * @param integer $target
5
- * @return integer
+ * @param Integer[] $nums
+ * @param Integer $target
+ * @return Integer
6
*/
7
-
8
function searchInsert($nums, $target) {
9
- $key = array_search($target, $nums);
10
- if ($key !== false) {
11
- return $key;
+ $l = 0;
+ $r = count($nums);
+ while ($l < $r) {
+ $mid = $l + $r >> 1;
12
+ if ($nums[$mid] >= $target) {
13
+ $r = $mid;
14
+ } else {
15
+ $l = $mid + 1;
16
+ }
17
}
- $nums[] = $target;
- sort($nums);
- return array_search($target, $nums);
18
+ return $l;
19
20
0 commit comments