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

最新推荐文章于 2020-12-22 11:51:53 发布

原创最新推荐文章于 2020-12-22 11:51:53 发布 · 264 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

数据结构与算法专栏收录该内容

37 篇文章

订阅专栏

本文深入探讨了二分查找算法的两种应用场景：一维数组中目标值插入位置的确定及二维矩阵中的目标值搜索。通过具体示例和代码实现，详细讲解了如何利用二分查找高效解决问题。

/**********************************************************************************************************
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;
            else
                last = mid;
        }
        return false;
    }
};

参考资料：

LeetCode题解