0074-search-a-2d-matrix.rs

use std::cmp::Ordering::{Equal,Less,Greater};

implSolution{
pubfnsearch_matrix(matrix:Vec<Vec<i32>>,target:i32) -> bool{
let(mut t,mut b) = (0, matrix.len());
letmut row = 0;
while t < b {
 row = t + (b - t) / 2;
let first = matrix[row][0];
let last = *matrix[row].last().unwrap();
if target == first || target == last {
returntrue;
}elseif target < first {
 b = row;
}elseif target > last {
 t = row + 1;
}else{
break;
}
}

if t > b {
returnfalse;
}

let(mut l,mut r) = (0, matrix[row].len());
while l < r {
let col = l + (r - l) / 2;
match target.cmp(&matrix[row][col]){
Equal => returntrue,
Less => r = col,
Greater => l = col + 1
}
}

false
}
}