public static void main(String args[]) {
        DungeonGame dg = new DungeonGame();
        int[][] dungeon = {{-2, -3, 3}, {-5, -10, 1}, {10, 30, -30}};
        System.out.print(dg.calculateMinimumHP(dungeon));
    }
Date 03/21/2016
@author Tushar Roy

Minimum life needed for knight to reach princess in 2D matrix.

Time complexity O(n^2)
Space complexity O(n^2)

https://leetcode.com/problems/dungeon-game/
src/com/interview/dynamic/DungeonGame.java