LeetCode 之 Triangle

原题：

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle

[
     [2],
    [3,4],
   [6,5,7],
  [4,1,8,3]
]

The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).

Note:
Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

这个题，哇塞，标准的DP，对任意一个点，对其返回的下一层的两个挨着的结果中选一个小的，就行了，我这里的DP是用一个record来保存的，其中用到了INT_MIN，另外，用了一个depth和pos。用一个record[depth][pos]记录第depth层的第pos个元素的最小值。如图：

代码如下（44ms）：

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        
        //初始化，和原来的triangle一样的record
        vector<vector<int> > record (triangle);
        for (int i = 0 ; i<record.size() ; i++){
            for (int j =0; j<record[i].size() ; j++){
                record[i][j] = INT_MIN;
            }
        }
        
        return DFS(triangle , 0 , 0 , record);
    }
    
    int DFS(vector<vector<int> > &triangle , int depth , int pos , vector<vector<int> > &record ){
       
        //需要判断出界，因为数组的大小有界别，要不会runtime error
        if(depth>=triangle.size() || pos >= triangle[depth].size())
            return 0;
        
        if(record[depth][pos] != INT_MIN) return record[depth][pos];
        int result = 0;
        result =  min( DFS(triangle , depth+1 , pos , record)+triangle[depth][pos] ,
                       DFS(triangle , depth+1 , pos+1 , record)+triangle[depth][pos]);
        record[depth][pos] = result;
        return result;
    }
};