Binary Search LeetCode solution in Rust

1
use std::cmp::Ordering;
2

3
impl Solution {
4
  pub fn search(nums: Vec<i32>, target: i32) -> i32 {
5
    let mut min: i32 = 0;
6
    let mut max = (nums.len() - 1) as i32; // use i32 to be able to go under zero
7

8
    while min <= max {
9
      let mid = (min + max) / 2;
10
      match nums[mid as usize].cmp(&target) {
11
        Ordering::Equal => return mid,
12
        Ordering::Less => min = mid + 1,
13
        Ordering::Greater => max = mid - 1,
14
      }
15
    }
16
    return -1;
17
  }
18
}