Description
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Examples
Example 1:
Input: [1,3,5,6], 5
Output: 2
Example 2:
Input: [1,3,5,6], 2
Output: 1
Example 3:
Input: [1,3,5,6], 7
Output: 4
Example 4:
Input: [1,3,5,6], 0
Output: 0
解题思路
没想法
所以线性查找了
结果居然超过了100%,二分查找居然还会慢hhhhh真没想到
代码超短hhhhh
class Solution {
public int searchInsert(int[] nums, int target) {
int i;
for(i = 0; i < nums.length; i++)
if(nums[i] >= target)
return i;
return nums.length;
}
}