码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode]Binary Search-35. Search Insert Position

时间:2018-01-13 21:03:00      阅读:76      评论:0      收藏:0      [点我收藏+]

标签:bsp   ica   span   div   output   value   pre   else   array   

iven 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.

Example 1:

Input: [1,3,5,6], 5
Output: 2

 

Example 2:

Input: [1,3,5,6], 2
Output: 1

 

Example 3:

Input: [1,3,5,6], 7
Output: 4

 

Example 1:

Input: [1,3,5,6], 0
Output: 0
class Solution {  
public:  
    int searchInsert(vector<int> &nums, int target) {  
        if(nums.size() < 1) {  
            return 0;  
        } else if(nums.size() == 1) {  
            if(nums[0] > target) return 0;  
            else if(nums[0] == target) return 0;  
            else return 1;  
        } else {  
            int flag = 0;     
            if (nums[0] > target) return 0;  
            if(nums[nums.size() - 1] < target) return nums.size();  
            for(int i = 0; i <= nums.size() - 1; ++ i) {  
                if(nums[i] == target) return i;  
                else if (nums[i] < target) flag = i;  
                else {  
                    if(flag == i - 1) return i;  
                }  
            }  
        }  
    }  
};  

 

[leetcode]Binary Search-35. Search Insert Position

标签:bsp   ica   span   div   output   value   pre   else   array   

原文地址:https://www.cnblogs.com/chenhan05/p/8280201.html

(0)
(0)
   
举报
评论 一句话评论(0
0条  
登录后才能评论!
© 2014 mamicode.com 版权所有 京ICP备13008772号-2
迷上了代码!