add 1861

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1861|[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java) ||Medium|Array, Two Pointers|
 |1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) ||Medium|Math|
 |1859|[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java) ||Easy|String, Sort|
 |1854|[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java) ||Easy|Array|

src/main/java/com/fishercoder/solutions/_1861.java

@@ -0,0 +1,37 @@
+package com.fishercoder.solutions;
+
+public class _1861 {
+    public static class Solution1 {
+        public char[][] rotateTheBox(char[][] box) {
+            int m = box.length;
+            int n = box[0].length;
+            for (int i = 0; i < m; i++) {
+                for (int j = n - 1; j >= 0; j--) {
+                    if (box[i][j] == '#') {
+                        int empty = j + 1;
+                        while (empty < n && box[i][empty] == '.') {
+                            empty++;
+                        }
+                        if (empty < n && box[i][empty] == '.') {
+                            box[i][empty] = '#';
+                            box[i][j] = '.';
+                        } else if (empty - 1 < n && box[i][empty - 1] == '.') {
+                            box[i][empty - 1] = '#';
+                            box[i][j] = '.';
+                        }
+
+                    }
+                }
+            }
+            char[][] result = new char[n][m];
+            int k = m - 1;
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    result[j][k] = box[i][j];
+                }
+                k--;
+            }
+            return result;
+        }
+    }
+}