Solving Dungeon Game in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

## Problem Description

The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.

The knight has an initial health point represented by a positive integer. If at any point his health point drops to 0 or below, he dies immediately.

In order to reach the princess as quickly as possible, the knight decides to move only rightward or downward in each step.

Write a function to determine the knight's minimum initial health so that he is able to rescue the princess.

Note:

• The knight's health has no upper bound.

• Any room can contain threats or power-ups, even the first room the knight enters and the bottom-right room where the princess is imprisoned.

See the full details of the problem Dungeon Game at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go