Binary Search LeetCode solution in Java

1
class Solution {
2
  public int search(int[] nums, int target) {
3
    int l = 0;
4
    int r = nums.length - 1;
5
    return binarySearch(nums, l, r, target);
6
  }
7

8
  private int binarySearch(int[] nums, int l, int r, int target) {
9
    if (l <= r) {
10
      int mid = (r + l) / 2;
11

12
      if (nums[mid] == target) {
13
        return mid;
14
      }
15

16
      if (nums[mid] < target) {
17
        return binarySearch(nums, mid + 1, r, target);
18
      } else {
19
        return binarySearch(nums, l, mid - 1, target);
20
      }
21
    }
22
    return -1;
23
  }
24
}