Leetcode||35. Search Insert Position

原创 2017年10月13日 10:28:32

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

这题还是用二分查找比较实用,也算是一个比较耿直的二分查找变种

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        left = 0
        right = len(nums) - 1
        while left <= right:
        	mid = (left + right) / 2
        	if target == nums[mid]:
        		return mid
        	elif target > nums[mid]:
        		left = mid + 1
        	else: 
        		right = mid - 1
        return left



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

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

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

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

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

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