[LeetCode] Search Insert Position
来源:互联网 发布:淘宝返利的网站有哪些 编辑:程序博客网 时间:2024/05/02 01:58
题目:
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 {public: int searchInsert(int A[], int n, int target) { int i = 0; for(i = 0; i < n; i++) { if(A[i] >= target) { break; } } return i; }};
思路:
这题真的没的说了,不明白为什么A率不是第一,哈哈~
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
- Python 实现 淘宝秒杀 聚划算 自动提醒 源码
- C语言位字段应用
- leetcode Two Sum
- webservice锦集
- E0F
- [LeetCode] Search Insert Position
- 磁盘raid
- 用OpenSceneGraph实现的NeHe OpenGL教程 - 第二十七课
- 画图解释SQL联合语句
- c 语言语法
- 微信公众帐号开发教程第2篇-微信公众帐号的类型(普通和会议)
- PHP isset(),empty(),is_null()
- Windows下的Memcache安装
- Android中常用的位图操作