g0701_0800.s0704_binary_search.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0701_0800.s0704_binary_search;
// #Easy #Array #Binary_Search
public class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
if (target < nums[left] || target > nums[right]) {
return -1;
}
if (nums[left] == target) {
return left;
} else if (nums[right] == target) {
return right;
}
while (left <= right) {
int mid = left + (right - left) / 2;
if (target == nums[mid]) {
return mid;
} else if (target > nums[mid]) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}
}