1

Author: Ainevsia

notes/src/day2/lc59.md

@@ -60,4 +60,44 @@ impl Solution {
 
 可以发现这里的边界条件非常多，在一个循环中，如此多的边界条件，如果不按照固定规则来遍历，那就是一进循环深似海，从此offer是路人。
 
-然后好像就是我这种模拟的做法
+然后好像就是我这种模拟的做法
+
+
+```rust
+
+# struct Solution {}
+
+impl Solution {
+    pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
+        let mut m: Vec<Vec<i32>> = vec![vec![0i32; n as usize]; n as usize];
+        let mut current: i32 = 1i32;
+        for i in 0usize .. (n as usize + 1usize) / 2usize {
+            Self::f(&mut m, i, &mut current);
+        }
+        m
+    }
+
+    pub fn f(m: &mut Vec<Vec<i32>>, start: usize, start_num: &mut i32) {
+        let width: usize = m.len() - start * 2usize - 1usize;
+        if width == 0 { m[start][start] = *start_num; return; }
+        for i in 0..width {
+            m[start][start + i] = *start_num;
+            *start_num += 1i32;
+        }
+        for j in 0..width {
+            m[start + j][start + width] = *start_num;
+            *start_num += 1i32;
+        }
+        for i in 0..width {
+            m[start + width][start + width - i] = *start_num;
+            *start_num += 1i32;
+        }
+        for j in 0..width {
+            m[start + width - j][start] = *start_num;
+            *start_num += 1i32;
+        }
+    }
+}
+
+
+```