35. Search Insert Position
2017-02-26 09:18
351 查看
没有用比较好的对分查找,直接搜索了。
class Solution { public: int searchInsert(vector<int>& nums, int target) { int i=0; for(i=0;i<nums.size();i++) { if(nums[i]>=target) break; } return i; } };
相关文章推荐
- [leetcode] 35. Search Insert Position
- LeetCode Problem 35:Search Insert Position
- 35. Search Insert Position
- LeetCode 35 Search Insert Position
- leetcode——35——Search Insert Position
- LeetCode-35:Search Insert Position(寻找或插入位置)
- 35. Search Insert Position
- 35. Search Insert Position
- 35. Search Insert Position
- Java [leetcode 35]Search Insert Position
- 35. Search Insert Position
- LeetCode | 35. Search Insert Position
- LeetCode@Array_35_Search_Insert_Position
- LeetCode (35)Search Insert Position
- leetcode 35 Search Insert Position(二分法)
- leetcode-35 Search Insert Position
- [Leetcode 23] 35 Search Insert Position
- 35. Search Insert Position
- LeetCode 35 Search Insert Position
- LeetCode(35) Search Insert Position