leetcode Search Insert Position
2015-05-01 14:02
316 查看
class Solution { public: int searchInsert(vector<int>& nums, int target) { if (nums.size()==0) return 1; int l=0; int h=nums.size()-1; int mid; while (l<=h){ mid = (l+h)/2; if (nums[mid]==target) return mid; if (nums[mid]>target) h=mid-1; else if (nums[mid]<target) l=mid+1; } return l; } };
相关文章推荐
- Search Insert Position leetcode java
- LeetCode(34)SearchInsertPosition
- Leetcode 35. Search Insert Position (Medium) (java)
- 【leetcode】35. Search Insert Position
- leetcode[35]:Search Insert Position
- leetcode: Search Insert Position
- [LeetCode]Search Insert Position
- Search Insert Position--LeetCode
- Leetcode-search-insert-position
- LeetCode题解:Search Insert Position
- LeetCode | Search Insert Position
- LeetCode 035 Search Insert Position
- LeetCode Search Insert Position
- LeetCode(35)--Search Insert Position
- Search Insert Position - LeetCode
- leetcode:Search Insert Position 【Java 】
- leetcode:Search Insert Position菜鸟解法
- leetcode解题之35#Search Insert Position Java版 递归和非递归实现
- LeetCode 35. Search Insert Position(查找插入位置)
- LeetCode Online Judge 题目C# 练习 - Search Insert Position