zoukankan      html  css  js  c++  java
  • 【LintCode】060.Search Insert Position

    题目:

    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.

    [1,3,5,6],5 → 2
    
    [1,3,5,6],2 → 1
    
    [1,3,5,6], 7 → 4
    
    [1,3,5,6],0 → 0
    

      

    题解:

    Solution 1 ()

    class Solution {
        /** 
         * param A : an integer sorted array
         * param target :  an integer to be inserted
         * return : an integer
         */
    public:
        int searchInsert(vector<int> &A, int target) {
            if (A.size() == 0) {
                return 0;
            }
            int start = 0;
            int end = A.size() - 1;
            
            while (start + 1 < end) {
                int mid = start + (end - start) / 2;
                if (A[mid] == target) {
                    return mid;
                } else if (A[mid] > target) {
                    end = mid;
                } else {
                    start = mid;
                }
            }
            if (A[start] >= target) {
                return start;
            } else if (A[end] >= target) {
                return end;
            } else {
                return end + 1;
            }
        }
    };

    Solution 2 ()

    class Solution {
        /** 
         * param A : an integer sorted array
         * param target :  an integer to be inserted
         * return : an integer
         */
    public:
        int searchInsert(vector<int> &A, int target) {
            if (A.size() == 0) {
                return 0;
            }
            int start = 0;
            int end = A.size() - 1;
            while (start + 1 < end) {
                int mid = start + (end - start) / 2;
                if (A[mid] == target) {
                    return mid;
                } else if (A[mid] > target) {
                    end = mid;
                } else {
                    start = mid;
                }
            }
            if (A[end] == target) {
                return end;
            } 
            if (A[end] < target) {
                return end + 1;
            } 
            if (A[start] >= target) {
                return start;
            }
            
            return start + 1;
        }
    };
  • 相关阅读:
    Sqli-Labs less46-53
    Sqli-Labs less38-45
    Sqli-Labs less32-37
    移动web问题小结
    伪类与伪元素
    HTML5 视频直播
    判断鼠标移入移出元素时的方向
    Input操作文件
    利用WebStorm来管理你的Github
    webkit开发,app移动前端知识点
  • 原文地址:https://www.cnblogs.com/Atanisi/p/6821114.html
Copyright © 2011-2022 走看看