#1329

Sort the Matrix Diagonally

pupil · 410 · lc medium +25 · verified · 83.2% accepted · 3,570 likes · top 95%

Description

A matrix diagonal is a chain of cells sharing the same row - col value, running from the top row or left column downward to the right. For example, the diagonal at mat[2][0] in a 6 x 3 matrix includes mat[2][0], mat[3][1], and mat[4][2].

Given an integer matrix mat of size m x n, sort each diagonal independently in ascending order and return the resulting matrix.

Example 1:

Input: mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]

Output: [[1,1,1,1],[1,2,2,2],[1,2,3,3]]

Example 2:

Input: mat = [[11,25,66,1,69,7],[23,55,17,45,15,52],[75,31,36,44,58,8],[22,27,33,25,68,4],[84,28,14,11,5,50]]

Output: [[5,17,4,1,52,7],[11,11,25,45,8,69],[14,23,25,44,58,15],[22,27,31,36,50,66],[84,28,75,33,55,68]]

Code

1

2

3

class Solution:
    def diagonalSort(self, mat: List[List[int]]) -> List[List[int]]:

class Solution:
    def diagonalSort(self, mat: List[List[int]]) -> List[List[int]]: