leetCode->Search Insert Position

每天一刷 ，强迫学习

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.

Here are few examples.

[1,3,5,6]

, 5 → 2

[1,3,5,6]

, 2 → 1

[1,3,5,6]

, 7 → 4

[1,3,5,6]

, 0 → 0

很容易看出使用二分查找法，特别一点的是考虑数组中没有目标数字时下标位置依然返回。

public class Solution {
public int searchInsert(int[] A, int target) {
int location = 0;
int start = 0;
int end = A.length - 1;
while (start < end) {
location = start + (end - start) / 2;
if (A[location] == target) {
return location;
} else if (A[location] > target) {
end = location - 1;
} else {
start = location + 1;
}
}

if (A[start] >= target) {
return start;
} else if (A[start] < target) {
return start + 1;
}
return location;
}
}