Leetcode刷题记录

跟随
代码随想录

2021年9月27日 周二
704. 二分查找
力扣题目链接

class Solution {
public:
    int search(vector& nums, int target) {
        int low = 0, high = nums.size()-1;
        while(low <= high){
            //int mid = low + (high - low) / 2;
            int mid = (high + low) / 2;
            int num = nums[mid];
            if(num == target){
                return mid;
            }
            else if(num < target){
                low = mid + 1;
            }
            else{
                high = mid - 1;
            }
        }
        return -1;
    }
};

2021年9月28日 周三
35. 搜索插入位置
力扣题目链接

class Solution {
public:
    int searchInsert(vector& nums, int target) {
        int low = 0, high = nums.size() - 1;
        while(low <= high){
            int mid = (high + low) / 2;
            int num = nums[mid];
            if(num == target){
                return mid;
            }
            else if(num < target){
                low = mid + 1;
            }
            else{
                high = mid -1;
            }
        }
        return low;
    }
};