xxxxxxxxxx
function searchInsert(nums: number[], target: number): number {
};
xxxxxxxxxx
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
}
};
xxxxxxxxxx
public class Solution {
public int SearchInsert(int[] nums, int target) {
}
}
xxxxxxxxxx
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var searchInsert = function(nums, target) {
};
xxxxxxxxxx
# @param {Integer[]} nums
# @param {Integer} target
# @return {Integer}
def search_insert(nums, target)
end
xxxxxxxxxx
class Solution {
func searchInsert(_ nums: [Int], _ target: Int) -> Int {
}
}
xxxxxxxxxx
class Solution {
/**
* @param Integer[] $nums
* @param Integer $target
* @return Integer
*/
function searchInsert($nums, $target) {
}
}
xxxxxxxxxx
class Solution {
public int searchInsert(int[] nums, int target) {
int lo = 0, hi = nums.length - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (target < nums[mid]) hi = mid - 1;
else if (target > nums[mid]) lo = mid + 1;
else return mid;
}
return lo;
}
}
// TC: O(logn)