题目

代码

pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
    let mut left = 0;
    let mut right = nums.len()-1;
    let mut mid;
    while left <= right {
        mid = left + ((right - left) >> 1);
        if mid >= nums.len() {
            break;
        }
        match nums[mid].cmp(&target){
            std::cmp::Ordering::Less => left = mid + 1,
            std::cmp::Ordering::Greater => right = mid -1,
            std::cmp::Ordering::Equal => return mid as i32,
        }
    }
    left as i32
}

leetcode 35 rust

原文：https://www.cnblogs.com/GeniusOfCX/p/14631818.html