20231121-Day 1-点亮代码技能

xymann

已于 2023-11-27 13:49:13 修改

阅读量40

点赞数

文章标签：笔记

于 2023-11-21 14:20:18 首次发布

本文链接：https://blog.csdn.net/qq_43487696/article/details/134530101

版权

Leetcode704（代码随想录：二分查找）

C++代码：

vector对象: vector<int> nums;

1. 求vector数组长度：nums.size();

[left, right)情况：

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

    }
};

[left, right]情况：

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

    }
};

Python代码：

1. python求数组nums长度：

len(nums)

2. python取整：

middle = (left + right) // 2

[left, right)情况：

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        left = 0
        right = len(nums)
        while left < right:
            middle = (left + right) // 2
            if nums[middle] < target:
                left = middle + 1
            elif target < nums[middle]:
                right = middle
            else:
                return middle
        return -1

[left, right]情况：

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        left = 0
        right = len(nums) - 1
        while left <= right:
            middle = (left + right) // 2
            if nums[middle] < target:
                left = middle + 1
            elif target < nums[middle]:
                right = middle - 1
            else:
                return middle
        return -1