public static void main(String args[]) {
        LongestIncreasingPath lip = new LongestIncreasingPath();
        int[][] input = {{9, 9, 4},{6, 6, 8},{2, 1, 1}};
        int[][] input1 = {{3, 4, 5}, {3, 2, 6}, {2, 2, 1}};
        System.out.println(lip.longestIncreasingPath(input));
    }
Date 03/10/2016
@author Tushar Roy

Given a 2D matrix find longest increasing path length in this matrix.

Time complexity is O(n*m)
Space complexity is O(n*m)

Reference
https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
src/com/interview/dynamic/LongestIncreasingPath.java