leetcode-剑指47-OK

// language c
// 剑指47
// https://leetcode-cn.com/problems/li-wu-de-zui-da-jie-zhi-lcof/

// 用递归的方法做
int maxValue(int** grid, int gridSize, int* gridColSize){
    // max函数
    int getmax(int a, int b){
        if(a>b)
            return a;
        return b;
    }


    for(int i = 1; i< gridSize; i++){
        grid[i][0] += grid[i-1][0];
    }

    for(int i = 1; i< gridColSize[0]; i++){
        grid[0][i] += grid[0][i-1];
    }

    for(int i = 1;i<gridSize;i++){
        for(int j = 1; j<gridColSize[0]; j++){
            grid[i][j] += getmax(grid[i-1][j], grid[i][j-1]);
        }
    }

    return grid[gridSize-1][gridColSize[0]-1];
}