feat: add solutions to lc problem: No.1861

No.1861.Rotating the Box

Author: yanglbme

index.html

@@ -10,7 +10,7 @@
   <meta name="description" content="LeetCode、剑指Offer、程序员面试金典题解">
   <meta name="viewport"
     content="width=device-width, user-scalable=no, initial-scale=1.0, maximum-scale=1.0, minimum-scale=1.0">
-  <link rel="stylesheet" href="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/docsify/lib/themes/vue.css">
+  <link rel="stylesheet" href="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/docsify@4.13.0/lib/themes/vue.css">
   <link rel="stylesheet" href="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/docsify-darklight-theme@latest/dist/style.min.css">
   <link rel="stylesheet" href="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/katex@latest/dist/katex.min.css"/>
   <link rel="icon" type="image/png" sizes="32x32" href="images/favicon-32x32.png">
@@ -125,7 +125,7 @@
       ]
     }
   </script>
-  <script src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/docsify/lib/docsify.min.js"></script>
+  <script src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/docsify@4.13.0/lib/docsify.min.js"></script>
   <script src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/prismjs/components/prism-c.min.js"></script>
   <script src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/prismjs/components/prism-go.min.js"></script>
   <script src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/npm/prismjs/components/prism-sql.min.js"></script>

solution/1800-1899/1861.Rotating the Box/README.md

@@ -74,7 +74,11 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-先旋转，再挪动箱子。
+**方法一：队列模拟**
+
+我们先将矩阵顺时针旋转 90 度，然后模拟每一列石头的下落过程。
+
+时间复杂度 $O(m \times n)$，空间复杂度 $O(m \times n)$。其中 $m$ 和 $n$ 分别是矩阵的行数和列数。
 
 <!-- tabs:start -->
 
@@ -86,25 +90,22 @@
 class Solution:
     def rotateTheBox(self, box: List[List[str]]) -> List[List[str]]:
         m, n = len(box), len(box[0])
-        res = [[None] * m for _ in range(n)]
+        ans = [[None] * m for _ in range(n)]
         for i in range(m):
             for j in range(n):
-                res[j][m - i - 1] = box[i][j]
+                ans[j][m - i - 1] = box[i][j]
         for j in range(m):
             q = deque()
             for i in range(n - 1, -1, -1):
-                if res[i][j] == '*':
+                if ans[i][j] == '*':
                     q.clear()
-                    continue
-                if res[i][j] == '.':
+                elif ans[i][j] == '.':
                     q.append(i)
-                else:
-                    if not q:
-                        continue
-                    res[q.popleft()][j] = '#'
-                    res[i][j] = '.'
+                elif q:
+                    ans[q.popleft()][j] = '#'
+                    ans[i][j] = '.'
                     q.append(i)
-        return res
+        return ans
 ```
 
 ### **Java**
@@ -115,36 +116,98 @@ class Solution:
 class Solution {
     public char[][] rotateTheBox(char[][] box) {
         int m = box.length, n = box[0].length;
-        char[][] res = new char[n][m];
+        char[][] ans = new char[n][m];
         for (int i = 0; i < m; ++i) {
             for (int j = 0; j < n; ++j) {
-                res[j][m - i - 1] = box[i][j];
+                ans[j][m - i - 1] = box[i][j];
             }
         }
         for (int j = 0; j < m; ++j) {
             Deque<Integer> q = new ArrayDeque<>();
             for (int i = n - 1; i >= 0; --i) {
-                if (res[i][j] == '*') {
+                if (ans[i][j] == '*') {
                     q.clear();
-                    continue;
-                }
-                if (res[i][j] == '.') {
+                } else if (ans[i][j] == '.') {
                     q.offer(i);
-                } else {
-                    if (q.isEmpty()) {
-                        continue;
-                    }
-                    res[q.poll()][j] = '#';
-                    res[i][j] = '.';
+                } else if (!q.isEmpty()) {
+                    ans[q.pollFirst()][j] = '#';
+                    ans[i][j] = '.';
                     q.offer(i);
                 }
             }
         }
-        return res;
+        return ans;
     }
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<vector<char>> rotateTheBox(vector<vector<char>>& box) {
+        int m = box.size(), n = box[0].size();
+        vector<vector<char>> ans(n, vector<char>(m));
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                ans[j][m - i - 1] = box[i][j];
+            }
+        }
+        for (int j = 0; j < m; ++j) {
+            queue<int> q;
+            for (int i = n - 1; ~i; --i) {
+                if (ans[i][j] == '*') {
+                    queue<int> t;
+                    swap(t, q);
+                } else if (ans[i][j] == '.') {
+                    q.push(i);
+                } else if (!q.empty()) {
+                    ans[q.front()][j] = '#';
+                    q.pop();
+                    ans[i][j] = '.';
+                    q.push(i);
+                }
+            }
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func rotateTheBox(box [][]byte) [][]byte {
+	m, n := len(box), len(box[0])
+	ans := make([][]byte, n)
+	for i := range ans {
+		ans[i] = make([]byte, m)
+	}
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			ans[j][m-i-1] = box[i][j]
+		}
+	}
+	for j := 0; j < m; j++ {
+		q := []int{}
+		for i := n - 1; i >= 0; i-- {
+			if ans[i][j] == '*' {
+				q = []int{}
+			} else if ans[i][j] == '.' {
+				q = append(q, i)
+			} else if len(q) > 0 {
+				ans[q[0]][j] = '#'
+				q = q[1:]
+				ans[i][j] = '.'
+				q = append(q, i)
+			}
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1861.Rotating the Box/README_EN.md

@@ -7,13 +7,9 @@
 <p>You are given an <code>m x n</code> matrix of characters <code>box</code> representing a side-view of a box. Each cell of the box is one of the following:</p>
 
 <ul>
-
     <li>A stone <code>&#39;#&#39;</code></li>
-
     <li>A stationary obstacle <code>&#39;*&#39;</code></li>
-
     <li>Empty <code>&#39;.&#39;</code></li>
-
 </ul>
 
 <p>The box is rotated <strong>90 degrees clockwise</strong>, causing some of the stones to fall due to gravity. Each stone falls down until it lands on an obstacle, another stone, or the bottom of the box. Gravity <strong>does not</strong> affect the obstacles&#39; positions, and the inertia from the box&#39;s rotation <strong>does not </strong>affect the stones&#39; horizontal positions.</p>
@@ -91,15 +87,10 @@
 <p><strong>Constraints:</strong></p>
 
 <ul>
-
     <li><code>m == box.length</code></li>
-
     <li><code>n == box[i].length</code></li>
-
     <li><code>1 &lt;= m, n &lt;= 500</code></li>
-
     <li><code>box[i][j]</code> is either <code>&#39;#&#39;</code>, <code>&#39;*&#39;</code>, or <code>&#39;.&#39;</code>.</li>
-
 </ul>
 
 ## Solutions
@@ -112,25 +103,22 @@
 class Solution:
     def rotateTheBox(self, box: List[List[str]]) -> List[List[str]]:
         m, n = len(box), len(box[0])
-        res = [[None] * m for _ in range(n)]
+        ans = [[None] * m for _ in range(n)]
         for i in range(m):
             for j in range(n):
-                res[j][m - i - 1] = box[i][j]
+                ans[j][m - i - 1] = box[i][j]
         for j in range(m):
             q = deque()
             for i in range(n - 1, -1, -1):
-                if res[i][j] == '*':
+                if ans[i][j] == '*':
                     q.clear()
-                    continue
-                if res[i][j] == '.':
+                elif ans[i][j] == '.':
                     q.append(i)
-                else:
-                    if not q:
-                        continue
-                    res[q.popleft()][j] = '#'
-                    res[i][j] = '.'
+                elif q:
+                    ans[q.popleft()][j] = '#'
+                    ans[i][j] = '.'
                     q.append(i)
-        return res
+        return ans
 ```
 
 ### **Java**
@@ -139,33 +127,95 @@ class Solution:
 class Solution {
     public char[][] rotateTheBox(char[][] box) {
         int m = box.length, n = box[0].length;
-        char[][] res = new char[n][m];
+        char[][] ans = new char[n][m];
         for (int i = 0; i < m; ++i) {
             for (int j = 0; j < n; ++j) {
-                res[j][m - i - 1] = box[i][j];
+                ans[j][m - i - 1] = box[i][j];
             }
         }
         for (int j = 0; j < m; ++j) {
             Deque<Integer> q = new ArrayDeque<>();
             for (int i = n - 1; i >= 0; --i) {
-                if (res[i][j] == '*') {
+                if (ans[i][j] == '*') {
                     q.clear();
-                    continue;
-                }
-                if (res[i][j] == '.') {
+                } else if (ans[i][j] == '.') {
                     q.offer(i);
-                } else {
-                    if (q.isEmpty()) {
-                        continue;
-                    }
-                    res[q.poll()][j] = '#';
-                    res[i][j] = '.';
+                } else if (!q.isEmpty()) {
+                    ans[q.pollFirst()][j] = '#';
+                    ans[i][j] = '.';
                     q.offer(i);
                 }
             }
         }
-        return res;
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<vector<char>> rotateTheBox(vector<vector<char>>& box) {
+        int m = box.size(), n = box[0].size();
+        vector<vector<char>> ans(n, vector<char>(m));
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                ans[j][m - i - 1] = box[i][j];
+            }
+        }
+        for (int j = 0; j < m; ++j) {
+            queue<int> q;
+            for (int i = n - 1; ~i; --i) {
+                if (ans[i][j] == '*') {
+                    queue<int> t;
+                    swap(t, q);
+                } else if (ans[i][j] == '.') {
+                    q.push(i);
+                } else if (!q.empty()) {
+                    ans[q.front()][j] = '#';
+                    q.pop();
+                    ans[i][j] = '.';
+                    q.push(i);
+                }
+            }
+        }
+        return ans;
     }
+};
+```
+
+### **Go**
+
+```go
+func rotateTheBox(box [][]byte) [][]byte {
+	m, n := len(box), len(box[0])
+	ans := make([][]byte, n)
+	for i := range ans {
+		ans[i] = make([]byte, m)
+	}
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			ans[j][m-i-1] = box[i][j]
+		}
+	}
+	for j := 0; j < m; j++ {
+		q := []int{}
+		for i := n - 1; i >= 0; i-- {
+			if ans[i][j] == '*' {
+				q = []int{}
+			} else if ans[i][j] == '.' {
+				q = append(q, i)
+			} else if len(q) > 0 {
+				ans[q[0]][j] = '#'
+				q = q[1:]
+				ans[i][j] = '.'
+				q = append(q, i)
+			}
+		}
+	}
+	return ans
 }
 ```
 

solution/1800-1899/1861.Rotating the Box/Solution.cpp

@@ -0,0 +1,29 @@
+class Solution {
+public:
+    vector<vector<char>> rotateTheBox(vector<vector<char>>& box) {
+        int m = box.size(), n = box[0].size();
+        vector<vector<char>> ans(n, vector<char>(m));
+        for (int i = 0; i < m; ++i) {
+            for (int j = 0; j < n; ++j) {
+                ans[j][m - i - 1] = box[i][j];
+            }
+        }
+        for (int j = 0; j < m; ++j) {
+            queue<int> q;
+            for (int i = n - 1; ~i; --i) {
+                if (ans[i][j] == '*') {
+                    queue<int> t;
+                    swap(t, q);
+                } else if (ans[i][j] == '.') {
+                    q.push(i);
+                } else if (!q.empty()) {
+                    ans[q.front()][j] = '#';
+                    q.pop();
+                    ans[i][j] = '.';
+                    q.push(i);
+                }
+            }
+        }
+        return ans;
+    }
+};