题解 | #最小三角路径和#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param cows int整型vector<vector<>> 
     * @return int整型
     */
    int minimumTotal(vector<vector<int> >& cows) {
        // write code here
        int index = 0;
        int sum = cows[0][0];
        for (int i = 1; i < cows.size(); i++) {
            sum += min(cows[i][index], cows[i][index+1]);
            if (cows[i][index+1] < cows[i][index]) {
                index++;
            }
        }
        return sum;
    }
};