1329. Sort the Matrix Diagonally
·
Algorithm
Sort the Matrix Diagonally - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2차원 배열이 주어진다. 배열을 우측 하단 대각성 방향으로 오름차순 정렬한 뒤 반환하는 문제다. 1. 구현 from typing import * class Solution: def diagonalSort(self, mat: List[List[int]]) -> List[List[int]]: if not mat: return None height, width = len..