题解 | #二分查找-I# | Rust
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
struct Solution{
}
impl Solution {
fn new() -> Self {
Solution{}
}
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param nums int整型一维数组
* @param target int整型
* @return int整型
*/
pub fn search(&self, nums: Vec<i32>, target: i32) -> i32 {
let mut low:i32 = 0;
let mut high = nums.len() as i32 -1;
while low <= high {
let mid = low + (high-low)/2;
if target == nums[mid as usize] {
return mid;
} else if target > nums[mid as usize] {
low = mid + 1;
} else {
high = mid - 1;
}
}
return -1;
}
}