leetcode-Search Insert Position (2014.3.10)
2014-04-13 22:13
260 查看
class Solution {
public:
int searchInsert(int A[], int n, int target) {
if(n==0) return 0;
if(target<A[0]) return 0;
if(target>A[n-1]) return n;
for(int i=0;i<n;i++){
if(target==A[i]) return i;
if(target>A[i]) continue;
if(target<A[i]) return i;
}
}
};
public:
int searchInsert(int A[], int n, int target) {
if(n==0) return 0;
if(target<A[0]) return 0;
if(target>A[n-1]) return n;
for(int i=0;i<n;i++){
if(target==A[i]) return i;
if(target>A[i]) continue;
if(target<A[i]) return i;
}
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode编程练习 - Search Insert Position学习心得
- LeetCode OJ Search Insert Position
- 【LeetCode with Python】 Search Insert Position
- LeetCode "Search Insert Position"
- [leetcode]_Search Insert Position
- leetcode 【 Search Insert Position 】python 实现
- leetcode 35 -- Search Insert Position
- LeetCode:Search Insert Position
- LeetCode: Search Insert Position [034]
- Leetcode 35. Search Insert Position
- leetcode-Search Insert Position
- ***(leetcode) Search Insert Position
- 开始刷leetcode day11：Search Insert Position
- [leetcode]解题报告35. Search Insert Position
- LeetCode 35 Search Insert Position 二分法处理
- leetcode(35) - Search Insert Position
- leetcode.array--35. Search Insert Position
- [LeetCode] Search Insert Position
- [LeetCode] Search Insert Position
- LeetCode *** 35. Search Insert Position