leetcode\Shift2DGrid::shiftGrid()

Complexity

Conditions	4
Paths	5

Size

Total Lines	16
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public static function shiftGrid(array $grid, int $k): array
    {
        if (empty($grid)) {
            return [];
        }
        [$ans, $n] = [[], count($grid[0])];
        $arr = array_merge(...array_values($grid));

        while ($k--) {
            array_unshift($arr, array_pop($arr));
        }
        for ($i = 0, $m = count($arr); $i < $m; $i += $n) {
            array_push($ans, array_slice($arr, $i, $n));
        }

        return $ans;
    }