---
title: "498. Diagonal Traverse"
url: "https://laigary.com/interview/coding/498-diagonal-traverse"
type: "note"
section: "coding"
date: "2023-01-27"
updated: "2023-01-27"
tags: ["Array"]
---

# 498. Diagonal Traverse

[498\. Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)

```python
class Solution:
    def findDiagonalOrder(self, mat: List[List[int]]) -> List[int]:

        if not mat or not mat[0]:
            return []

        R = len(mat)
        C = len(mat[0])

        res = []
        tmp = []
        for i in range(R + C - 1):
            tmp.clear()

            r = 0 if i < C else i - C + 1
            c = i if i < C else C - 1

            while r < R and c > -1:
                tmp.append(mat[r][c])
                r += 1
                c -= 1

            if i % 2 == 0:
                res.extend(tmp[::-1])
            else:
                res.extend(tmp)

        return res
```