Published on 2022-03-17
Published on 2022-03-15
分析由于从骑士开始走的话需要提前知道路径和起始健康点数，所以可以从公主去找骑士，只需要朝两个方向中所需的最小健康点方向即可。class Solution {public: int calculateMinimumHP(vector<vector<int>>& d
Published on 2022-03-15
Published on 2022-03-15
Published on 2022-03-14
Published on 2022-03-13
Published on 2022-03-13
class Solution {public: int minimumTotal(vector<vector<int>>& triangle) { vector<vector<int>>f= triangle;
Published on 2022-03-12
Published on 2022-03-12
Published on 2022-03-12
-ca9fe781c2d244deaabd5ebe8c1c61a1.JPG)
