[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.

貌似想的有点复杂了，题目的意思是第一行一定只有一个元素。

class Solution {
public:
    int minimumTotal(vector<vector<int> > &triangle) {
        int m = triangle.size();
        int n = triangle[0].size(),i,j;
        int f[m][n+m-1];
        int ans;
        //f[0][0] = triangle[0][0];
        for(j=0;j<n;j++){
            f[0][j] = triangle[0][j];
        }
        for(i=1;i<m;i++){
            f[i][0] = f[i-1][0] + triangle[i][0];
            f[i][n+i-1] = f[i-1][n+i-2]+triangle[i][n+i-1];
        }
        if(n==1){
            for(i=2;i<m;i++){
                for(j=1;j<i;j++){
                    f[i][j]=min(f[i-1][j-1],f[i-1][j])+triangle[i][j];
                }
            }
        }
        else{
        for(i=1;i<m;i++){
            for(j=0;j<n+i;j++){
                f[i][j] = min(f[i-1][j-1],f[i-1][j])+triangle[i][j];
            }
        }
        }
        ans=f[m-1][0];
        for(j=1;j<n+m-1;j++){
            if(f[m-1][j]<ans) ans=f[m-1][j];
        }
        return ans;
    }
};