# 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 binarySearch(int[] nums, int target) {
int low = 0;
int high = nums.length - 1;
while(low <= high) {
int mid = (low + high) / 2;
if(nums[mid] == target)
return mid;
else if(nums[mid] > target)
high = mid - 1;
else
low = mid + 1;
}
return low;
}
public int searchInsert(int[] nums, int target) {
if(nums == null || nums.length == 0)
throw new IllegalArgumentException();
return binarySearch(nums, target);
}
}
• 本文已收录于以下专栏：

## leetcode: Search Insert Position

Search Insert Position

## [LeetCode]35.Search Insert Position

【题目】 Given a sorted array and a target value, return the index if the target is found. If not, ...

## LeetCode 35 Search Insert Position (C,C++,Java,Python)

Problem: Given a sorted array and a target value, return the index if the target is found. If n...

## LeetCode035 Search Insert Position

• zxwtry
• 2017年04月04日 19:32
• 79

## LeetCode 35. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the...

## Search insert position @leetcode

leetcode原题地址：https://oj.leetcode.com/problems/search-insert-position/        原题内容如下： Given a sor...

## [LeetCode35]Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the...
• sbitswc
• 2014年06月16日 04:11
• 560

## <LeetCode OJ> 35. Search Insert Position

35. Search Insert Position My Submissions Question Total Accepted: 94638 Total Submissions: 2569...

举报原因： 您举报文章：Search Insert Position 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)