Middle-题目13:35. Search Insert Position

原创 2016年05月31日 15:33:21

题目原文:
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
题目大意:
给出一个排序好的数组,和一个目标值,求出把目标值插到原数组保持升序的情况下,目标值所在的数组下标。
题目分析:
在二分查找的基础上简单变形即可,需要注意目标值在两端的特殊情况。
源码:(language:java)

public class Solution {
    public int searchInsert(int[] nums, int target) {
        int start = 0,end = nums.length - 1;
        int mid = 0;
        while(start <= end) {
            mid = (start + end) / 2;
            if(nums[mid] == target)
                return mid;
            else if(nums[mid] > target) { //target lies between start and mid
                if(mid == 0 || nums[mid - 1] < target)
                    return mid;
                else
                    end=mid-1;
            }
            else { //target lies between mid and end
                if(mid == nums.length-1 || nums[mid + 1] > target)
                    return mid+1;
                else
                    start=mid+1;
            }               
        }
        return mid;         
    }
}

成绩:
0ms,beats 19.33%,众数0ms,90.67%

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

[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...

LeetCode 35 — Search Insert Position(C++ Java Python)

题目:http://oj.leetcode.com/problems/search-insert-position/ Given a sorted array and a target value...

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...

[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
  • sbitswc
  • 2014年06月16日 04:11
  • 585

<LeetCode OJ> 35. Search Insert Position

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

leetcode:35. Search Insert Position

描述Given a sorted array and a target value, return the index if the target is found. If not, return t...
  • Earl211
  • Earl211
  • 2017年03月16日 08:51
  • 160

leetcode 35. Search Insert Position

leetcode 35. Search Insert Position Given a sorted array and a target value, return the index if the...

leetcode35. Search Insert Position

35. Search Insert PositionGiven a sorted array and a target value, return the index if the target is...

LeetCode-Easy部分中标签为Array#35: Search Insert Position

确定一个有序数组中,插入目标值的索引位置,如果插入值已经存在,则直接返回它的索引值,如果不存在,确定插入后的索引位置。...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Middle-题目13:35. Search Insert Position
举报原因:
原因补充:

(最多只允许输入30个字)