## 0x01 题面

LeetCode 329. Longest Increasing Path in a Matrix 传送门

Given an integer matrix, find the length of the longest increasing path.

From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside of the boundary (i.e. wrap-around is not allowed).

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

## 0xFF 呱代码

Accepted @ 2018-03-05