美文网首页
35. Search Insert Position

35. Search Insert Position

作者: SilentDawn | 来源:发表于2018-05-27 16:50 被阅读0次

    Problem

    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.

    Example

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

    Code

    static int var = [](){
        std::ios::sync_with_stdio(false);
        cin.tie(NULL);
        return 0;
    }();
    class Solution {
    public:
        int searchInsert(vector<int>& nums, int target) {
            int i=0;
            for(;i<nums.size();i++){
                if(target <= nums[i])
                    return i;
            }
            return i;
        }
    };
    

    Result

    35. Search Insert Position.png

    相关文章

      网友评论

          本文标题:35. Search Insert Position

          本文链接:https://www.haomeiwen.com/subject/soobjftx.html