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

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;
        }
    }
}