feat:add typescript, rust, cpp solutions for lcof 29

Author: ScarboroughCoral

lcof/面试题29. 顺时针打印矩阵/Solution.cpp

@@ -0,0 +1,35 @@
+class Solution
+{
+public:
+    vector<int> spiralOrder(vector<vector<int>> &matrix)
+    {
+        vector<int> ans;
+        if (matrix.size() == 0)
+            return ans;
+        int left = 0, top = 0, bottom = matrix.size() - 1, right = matrix[0].size() - 1;
+        while (true)
+        {
+            for (int i = left; i <= right; i++)
+                ans.push_back(matrix[top][i]);
+            top++;
+            if (top > bottom)
+                break;
+            for (int i = top; i <= bottom; i++)
+                ans.push_back(matrix[i][right]);
+            right--;
+            if (right < left)
+                break;
+            for (int i = right; i >= left; i--)
+                ans.push_back(matrix[bottom][i]);
+            bottom--;
+            if (bottom < top)
+                break;
+            for (int i = bottom; i >= top; i--)
+                ans.push_back(matrix[i][left]);
+            left++;
+            if (left > right)
+                break;
+        }
+        return ans;
+    }
+};

lcof/面试题29. 顺时针打印矩阵/Solution.rs

@@ -0,0 +1,40 @@
+impl Solution {
+    pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
+        let mut ans=Vec::new();
+        if matrix.len()==0{
+            return ans;
+        }
+        let (mut left,mut right,mut top,mut bottom)=(0,matrix[0].len()-1,0,matrix.len()-1);
+        loop{
+            for i in left..right+1{
+                ans.push(matrix[top][i]);
+            }
+            top+=1;
+            if (top as i32)>(bottom as i32){
+                break;
+            }
+            for i in top..bottom+1{
+                ans.push(matrix[i][right]);
+            }
+            right-=1;
+            if (right as i32)<(left as i32){
+                break;
+            }
+            for i in (left..right+1).rev(){
+                ans.push(matrix[bottom][i]);
+            }
+            bottom-=1;
+            if (bottom as i32)<(top as i32){
+                break;
+            }
+            for i in (top..bottom+1).rev(){
+                ans.push(matrix[i][left]);
+            }
+            left+=1;
+            if (left as i32)>(right as i32){
+                break;
+            }
+        }
+        ans
+    }
+  }

lcof/面试题29. 顺时针打印矩阵/Solution.ts

@@ -0,0 +1,23 @@
+var spiralOrder = (matrix: number[][]): number[] => {
+    let ans: number[] = [];
+    if (matrix.length === 0) return ans;
+    let top = 0,
+        left = 0,
+        bottom = matrix.length - 1,
+        right = matrix[0].length - 1;
+    while (true) {
+        for (let i = left; i <= right; i++) ans.push(matrix[top][i]);
+        top++;
+        if (top > bottom) break;
+        for (let i = top; i <= bottom; i++) ans.push(matrix[i][right]);
+        right--;
+        if (right < left) break;
+        for (let i = right; i >= left; i--) ans.push(matrix[bottom][i]);
+        bottom--;
+        if (bottom < top) break;
+        for (let i = bottom; i >= top; i--) ans.push(matrix[i][left]);
+        left++;
+        if (left > right) break;
+    }
+    return ans;
+}