35. Search Insert Position

原创 2016年08月29日 19:24:35

这两天需要先去读一些RFC啥的,没空做了。

Title

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

二分查找,然后插入,时间lg(n)。

Solution

one

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = nums.size();

        int low = 0, high = n-1, mid=0;

        while (low <= high) {
            mid = low + (high-low)/2;
            if (nums[mid] == target) {
                return mid;
            }
            else if (nums[mid] < target) {
                low = mid+1;
            }
            else {
                high = mid-1;
            }
        }

        if (nums[mid] > target) {
            return mid;
        }

        return mid+1;
    }
};

runtime: 8ms

two

date: 2016.9.16

二分查找,直接找到lower_bound解决此问题,关于二分查找的总结,请看这里:二分查找

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int n = (int)nums.size();
        int low = 0, high = n, mid;
        while (low < high) { //输入[low, high); high == nums.size()
            mid = low + (high-low)/2;
            if (nums[mid] >= target) { //继续查找[low, mid]
                high = mid;
            }
            else { //[mid+1, high]
                low = mid+1;
            }
        }
        return low; //返回[low, high]
    }
};

runtime: 6ms

版权声明:欢迎批评指正。

[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
  • 589

<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
  • 161

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

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

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