leetCode 35.Search Insert Position (搜索插入位置) 解题思路和方法

原创 2015年07月09日 16:24:25

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


思路:题目还是比较简单的,线性时间内可用循环遍历,不过也可以用二分查找,这样lgn的时间复杂度。

本文用二分实现,具体代码如下:

public class Solution {
    public int searchInsert(int[] nums, int target) {
    	//特殊情况
        if(nums.length == 0 || nums[0] > target)
            return 0;
        if(nums[nums.length - 1] < target)
        	return nums.length;
        //先二分查找,找到了就返回
        int low = 0;
        int hight = nums.length - 1;
        int mid = 0;
        while(low <= hight){
            mid = (low + hight)/2;
            if(nums[mid] < target){
                low = mid + 1;
            }else if(nums[mid] > target){
                hight = mid - 1;
            }else{
                return mid;
            }
        }
        //找不到再判断与nums[mid]大小,返回索引
        return nums[mid] > target?mid:mid+1;
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Leetcode刷题记—— 35. Search Insert Position(查找插入位置)

一、题目叙述: Given a sorted array and a target value, return t...

【LeetCode-面试算法经典-Java实现】【035-Search Insert Position(搜索插入位置)】

【035-Search Insert Position(搜索插入位置)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a sorted array and a...

LeetCode Search Insert Position查找插入位置

入门级题目。 思路有两个: 1 二分法查找到该数值,然后前移到比前面的数大的位置。如果没有找到就返回第一个比该数值大的数的下标。 2 可以二分法查找,不过稍微修改一下,例如查找1,3,5,6;那...

LeetCode | Search Insert Position(查找插入位置)

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

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

<LeetCode OJ> 35. Search Insert Position

35. Search Insert Position My Submissions Question Total Accepted: 94638 Total Submissions: 2569...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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