leetcode 704. 二分查找（java & python3）

java：

简单题重拳出击

学习一下二分 

class Solution {
    public int search(int[] nums, int target) {
        int n = nums.length;
        int l = 0, r = n-1;
        while(l <= r){
            int m = (l + r + 1) / 2;
            if(target == nums[m]){
                return m;
            }else if(target < nums[m]){
                r = m - 1;
            }else{
                l = m + 1;
            }
        }
        return -1;
    }
}

python3:

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