Leetcode-BinarySearch

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

You must write an algorithm with O(log n) runtime complexity.

Example 1:

Input: nums = [-1,0,3,5,9,12], target = 9
Output: 4
Explanation: 9 exists in nums and its index is 4

Example 2:

Input: nums = [-1,0,3,5,9,12], target = 2
Output: -1
Explanation: 2 does not exist in nums so return -1

Constraints:

1 <= nums.length <= 104
-104 < nums[i], target < 104
All the integers in nums are unique.
nums is sorted in ascending order.

解法

public class BinarySearch {
    public static void main(String[] args) {
        int arr[] = {-1, 0, 3, 5, 9, 12};

        int search = Solution.search(arr, 9);
        System.out.println(search);
    }

    static class Solution {

        public static int search(int[] nums, int target) {
            int left = 0, right = nums.length - 1;

            while (left <= right) {
                int mid = left + ((right - left) >> 1);

                if (nums[mid] == target)
                    return mid;
                else if (nums[mid] < target)
                    left = mid + 1;
                else
                    right = mid - 1;
            }
            return -1;
        }
    }

    // 左闭右开解法
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length;

        while (left < right) {
            int mid = left + ((left + right) >> 1);
            if (target > nums[mid]) {
                left = mid + 1;
            } else if (target < nums[mid]) {
                right = mid;
            } else {

                return mid;
            }
        }
        return -1;
    }

}

代码地址

二分查找
https://gitee.com/eistert/eistert-java-study-note/blob/master/leetcode/leetcode-programming-questions/src/main/java/com/eistert/leetcode/array/BinarySearch.java