查找 --- Search Insert Position --- 图解

/**********************************************************************************************************
7.2 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
分析
即 std::lower_bound()
**********************************************************************************************************/

class Solution{
public:int searchInsert(int A[],int n ,int target){return lower_bound(A,A + n,target) - A;}
};

/**********************************************************************************************************
7.3 Search a 2D Matrix
描述
Write an efficient algorithm that searches for a value in an m×n matrix. is matrix has the following
properties:
• Integers in each row are sorted from le to right.
• e first integer of each row is greater than the last integer of the previous row.
For example, Consider the following matrix:7.3 Search a 2D Matrix 117
[
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.
**********************************************************************************************************/

class Solution{
public:bool searchMatrix(const vecotr<vector<int>>& matrix ,int target){const size_t m = matrix.size();const size_t n = matrix.front().size();int first = 0;int last = m * n;while(first < last){int mid = first + (last - first )/2;int value = matrix[mid /n ][mid %n];if(value == target)return true;else if(value < target)first = mid + 1;elselast = mid;}return false;}
};

参考资料：

LeetCode题解

查找 --- Search Insert Position --- 图解相关推荐

LeetCode - 35. Search Insert Position
35. Search Insert Position Problem's Link ---------------------------------------------------------- ...
LeetCode算法入门- Search Insert Position -day19
LeetCode算法入门- Search Insert Position -day19 题目描述 Given a sorted array and a target value, return the ...
leetcode -- Search Insert Position
2019独角兽企业重金招聘Python工程师标准>>> Search Insert Position Given a sorted array and a target value, ...
【二分法】LeetCode 35. Search Insert Position
LeetCode 35. Search Insert Position Solution1:我的答案 class Solution { public:int searchInsert(vector&l ...
【LeetCode】- Search Insert Position（查找插入的位置）
[ 问题: ] Given a sorted array and a target value, return the index if the target is found. If not, re ...
LeetCode Search Insert Position （二分查找）
题意: 给一个升序的数组,如果target在里面存在了,返回其下标,若不存在,返回其插入后的下标. 思路: 来一个简单的二分查找就行了,注意边界. 1 class Solution { 2 publi ...
leetcode 【 Search Insert Position 】python 实现
题目: Given a sorted array and a target value, return the index if the target is found. If not, return ...
二分法：search insert position 插入位置
问题描述: 给定一个排序数组nums(无重复元素)与目标值target,如果target在nums里出现,则返回target所在下标,如果target在nums里未出现,则返回target应该插入 ...
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 --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 --- 图解

查找 --- Search Insert Position --- 图解相关推荐

最新文章

热门文章