【每日一题】1260. 二维网格迁移

主站链接：https://leetcode.cn/problems/shift-2d-grid/

class Solution:
    def shiftGrid(self, grid: List[List[int]], k: int) -> List[List[int]]:
        def convert_horizon(grid):
            temp = 0
            m = len(grid)
            n = len(grid[0])
            one_change = list()
            for nums in grid:
                temp = nums[-1]
                nums[1:n] = nums[:n-1]
                nums = deque(nums)
                nums.popleft()
                nums.appendleft(temp)
                one_change.append(list(nums))
            return one_change

        def convert_vertical(list_):
            list_copy = list_
            for index,value in enumerate(convert_horizon([[i[0] for i in list_copy]])[0]):
                list_[index][0] = value
            return list_

        ans = grid
        for _ in range(k):
            ans = convert_horizon(ans)
            ans = convert_vertical(ans)
        return ans

作者：li-ze-yu-o4
链接：https://leetcode.cn/problems/shift-2d-grid/solution/by-li-ze-yu-o4-phca/
来源：力扣（LeetCode） 著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。