solve #74

Author: aylei

src/lib.rs

@@ -73,3 +73,5 @@ mod n0069_sqrtx;
 mod n0070_climbing_stairs;
 mod n0071_simplify_path;
 mod n0072_edit_distance;
+mod n0073_set_matrix_zeroes;
+mod n0074_search_a_2d_matrix;

src/n0073_set_matrix_zeroes.rs

@@ -0,0 +1,68 @@
+/**
+ * [73] Set Matrix Zeroes
+ *
+ * Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it <a href="https://en.wikipedia.org/wiki/In-place_algorithm" target="_blank">in-place</a>.
+ * 
+ * Example 1:
+ * 
+ * 
+ * Input: 
+ * [
+ *   [1,1,1],
+ *   [1,0,1],
+ *   [1,1,1]
+ * ]
+ * Output: 
+ * [
+ *   [1,0,1],
+ *   [0,0,0],
+ *   [1,0,1]
+ * ]
+ * 
+ * 
+ * Example 2:
+ * 
+ * 
+ * Input: 
+ * [
+ *   [0,1,2,0],
+ *   [3,4,5,2],
+ *   [1,3,1,5]
+ * ]
+ * Output: 
+ * [
+ *   [0,0,0,0],
+ *   [0,4,5,0],
+ *   [0,3,1,0]
+ * ]
+ * 
+ * 
+ * Follow up:
+ * 
+ * 
+ * 	A straight forward solution using O(mn) space is probably a bad idea.
+ * 	A simple improvement uses O(m + n) space, but still not the best solution.
+ * 	Could you devise a constant space solution?
+ * 
+ * 
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
+        
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_73() {
+    }
+}

src/n0074_search_a_2d_matrix.rs

@@ -0,0 +1,89 @@
+/**
+ * [74] Search a 2D Matrix
+ *
+ * Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
+ * 
+ * 
+ * 	Integers in each row are sorted from left to right.
+ * 	The first integer of each row is greater than the last integer of the previous row.
+ * 
+ * 
+ * Example 1:
+ * 
+ * 
+ * Input:
+ * matrix = [
+ *   [1,   3,  5,  7],
+ *   [10, 11, 16, 20],
+ *   [23, 30, 34, 50]
+ * ]
+ * target = 3
+ * Output: true
+ * 
+ * 
+ * Example 2:
+ * 
+ * 
+ * Input:
+ * matrix = [
+ *   [1,   3,  5,  7],
+ *   [10, 11, 16, 20],
+ *   [23, 30, 34, 50]
+ * ]
+ * target = 13
+ * Output: false
+ * 
+ */
+pub struct Solution {}
+
+impl Solution {
+    pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
+        if matrix.is_empty() { return false }
+        let (height, width) = (matrix.len(), matrix[0].len());
+        if height < 1 || width < 1 { return false }
+        let mut size = height * width;
+        let mut base = 0_usize;
+        while size > 1 {
+            let half = size / 2;
+            let mid = base + half;
+            if target == matrix[mid/width][mid%width] {
+                return true
+            } else if (target > matrix[mid/width][mid%width]) {
+                base = mid;
+            }
+            size -= half;
+        }
+        target == matrix[base/width][base%width]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_74() {
+        assert_eq!(
+            Solution::search_matrix(
+                vec![
+                    vec![1,   3,  5,  7],
+                    vec![10, 11, 16, 20],
+                    vec![23, 30, 34, 50]
+                ], 3
+            ),
+            true
+        );
+        assert_eq!(
+            Solution::search_matrix(
+                vec![
+                    vec![1,   3,  5,  7],
+                    vec![10, 11, 16, 20],
+                    vec![23, 30, 34, 50]
+                ], 13
+            ),
+            false
+        );
+    }
+}