leetcode笔记：Dungeon Game

最新推荐文章于 2022-02-10 11:34:47 发布

Herbert_Zero

最新推荐文章于 2022-02-10 11:34:47 发布

阅读量4.5k

点赞数 2

分类专栏：数据结构与算法文章标签： leetcode c++ dp algorithm 动态规划

本文链接：https://blog.csdn.net/liyuefeilong/article/details/51324978

版权

本文详细介绍了LeetCode上的Dungeon Game问题，骑士需要通过地牢救公主，初始健康值需足够应对沿途的增减。通过动态规划方法，分析了问题规则，提出状态转移方程，并提供了示例代码进行解释。

摘要由CSDN通过智能技术生成

一. 题目描述

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.

Some of the rooms are guarded by demons, so the knight loses health (negative integers) upon entering these rooms; other rooms are either empty (0’s) or contain magic orbs that increase the knight’s health (positive integers).

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.

For example, given t