7.2—查找—Sear 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

#include<iostream>
using namespace std;
bool found = false;
int SearchInsertPosition(int a[], int n, int k)
{int index = -1;if (n <= 0)return index;int begin = 0;int end = n - 1;int mid;while (begin <= end){mid = (begin + end) / 2;if (a[mid] < k)begin = mid + 1;else if (a[mid] > k)end = mid - 1;else{index = mid;found = true;return index;}}//=====return begin;// end + 1;
}
int main()
{const int n = 4;int a[n] = { 1, 3, 5, 6 };int targt = 5;int index = SearchInsertPosition(a, n, targt);if (found)cout << "Found!" << " " << index << endl;elsecout << "Not Found! Insert" << " " << index << endl;
}

7.2—查找—Sear 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] Serch Insert Position (总结二分查找) Java version
原题地址:https://oj.leetcode.com/problems/search-insert-position/: 查找插入口,在使用二分查找发的时候需要注意,与以前不同.在没有找到与tar ...
二分法：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 ...

7.2—查找—Sear Insert Position

7.2—查找—Sear Insert Position相关推荐

最新文章

热门文章