LeetCode:Search Insert Position
来源:互联网 发布:淘宝小白 编辑:程序博客网 时间:2024/05/05 13:05
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
// Source : https://oj.leetcode.com/problems/search-insert-position/// Author : Chao Zeng// Date : 2014-12-19// 注意分类讨论个各种情况class Solution {public:int searchInsert(int A[], int n, int targe) {int index = 0;for (int i = 0; i < n; i++){if (targe < A[0]){index = 0;return index;}if (targe > A[n-1]){index = n;return index;}if (targe <= A[i]){index = i;return index;}}}};
0 0
- LeetCode: Search Insert Position
- LeetCode Search Insert Position
- [Leetcode] Search Insert Position
- LeetCode : Search Insert Position
- [LeetCode] Search Insert Position
- [Leetcode] Search Insert Position
- [LeetCode]Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode-Search Insert Position
- LeetCode - Search Insert Position
- LeetCode | Search Insert Position
- Leetcode: Search Insert Position
- 【LeetCode】Search Insert Position
- Leetcode Search Insert Position
- Leetcode: Search Insert Position
- LeetCode:Search Insert Position
- leetcode Search Insert Position
- LeetCode Search Insert Position
- sort函数的用法
- 使用python构建httpserver,python+tornado+pika+rabbitmq
- Mysql基础(二) 详解---锁
- 【数据结构】一颗二叉树的中序遍历和前序遍历,求后序遍历
- OOTV杯超级模式大赛——模式总结
- LeetCode:Search Insert Position
- mysql基础(三) Mysql锁机制简介
- openStack glance index
- 暂别博客,明年3月份后再来
- Dubbo与Zookeeper、SpringMVC整合使用
- C 语言程序设计实践 8.6 W.C之新店开张 V2.0
- Nmap绕过防火墙&脚本的使用
- Visual Basic-Ping!
- CF 54E Vacuum Сleaner