
[LeetCode]Diagonal Traverse
·
SW개발/코딩테스트
https://leetcode.com/problems/diagonal-traverse/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 문제 분석 주어진 m*n 그리드를 대각선 위 대각선 아래로 반복하면서 탐색하는 순서를 구하는 문제입니다. 처음 시도한 답안 class Solution: def findDiagonalOrder(self, m..