2 fors O(n*m)
Complexity\n- Time complexity:\nO(n*m)\n\n# Code\nrust []\nimpl Solution {\n    pub fn rotate_the_box(r#box: Vec<Vec<char>>) -> Vec<Vec<char>> {\n        let n 
# Complexity\n- Time complexity:\nO(n*m)\n\n# Code\n```rust []\nimpl Solution {\n    pub fn rotate_the_box(r#box: Vec<Vec<char>>) -> Vec<Vec<char>> {\n        let n = r#box.len();\n        let m = r#box[0].len();\n        let mut res = vec![vec![\'.\'; n]; m];\n\n        for i in 0..n {\n            let column = n-i-1;\n            let mut bottom = m;\n            for j in (0..m).rev() {\n                if r#box[i][j] == \'#\' {\n                    bottom -= 1;\n                    res[bottom][column]=\'#\';\n                } else if r#box[i][j] == \'*\' {\n                    bottom = j;\n                    res[bottom][column]=\'*\';\n                }\n            }\n        }\n\n        res\n    }\n}\n```
['Rust']