Longest Increasing Path in a Matrix Applying greedy by calc maxmium path sum

Question

Input: nums = 
[
  [9,9,4],
  [6,6,8],
  [2,1,1]
] 
Output: 4 
Explanation: The longest increasing path is [1, 2, 6, 9].

Usually Greedy wont work for Lo