Package g0701_0800.s0704_binary_search

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    704 - Binary Search\.

    Easy

    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:

    • <code>1 <= nums.length <= 10<sup>4</sup></code>

    • <code>-10<sup>4</sup>< numsi, target < 10<sup>4</sup></code>

    • All the integers in nums are unique.

    • nums is sorted in ascending order.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer search(IntArray nums, Integer target)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait