LeetCode 120：三角形最小路径和

三角形最小路径和

void trianglePrint(int** triangle, int triangleSize, int* triangleColSize){
    int i, j;
    for (i=0; i<triangleSize; ++i){
        for (j=0; j<triangleColSize[i]; ++j){
                printf("%d ", triangle[i][j]);
        }
        printf("
");
    }
    return ;
}

int minimumTotal(int** triangle, int triangleSize, int* triangleColSize){
    #define MINIMUM(a, b) ((a)>(b)?(b):(a))
    #define MAXIMUM(a, b) ((a)<(b)?(b):(a))
    int **dp, i, j, k, ret=0, n;
    if (triangleSize == 1) {
        return triangle[0][0];
    }
    dp = malloc(sizeof(int*) * triangleSize);
    for (i=0; i<triangleSize; ++i){
        dp[i] = malloc(sizeof(int) * triangleColSize[i]);
        memset(dp[i], 0, sizeof(int) * triangleColSize[i]);
    }
    
    dp[0][0] = triangle[0][0];
    dp[1][0] = triangle[1][0] + dp[0][0];
    dp[1][1] = triangle[1][1] + dp[0][0];
    //trianglePrint(dp, triangleSize, triangleColSize);

    for(i=2; i<triangleSize; ++i) {
        dp[i][0] = dp[i-1][0]+triangle[i][0];
        
        for (j=1; j<triangleColSize[i]-1; ++j){
            dp[i][j] = MINIMUM(dp[i-1][j-1], dp[i-1][j]) + triangle[i][j];
        }
        
        dp[i][triangleColSize[i]-1] = dp[i-1][triangleColSize[i-1]-1] + triangle[i][triangleColSize[i]-1];
    }
    //trianglePrint(dp, triangleSize, triangleColSize);
    i = triangleSize - 1;
    ret = dp[i][0];
    for (j = 1; j < triangleColSize[i]; ++j){
        ret = MINIMUM(ret, dp[i][j]);
    }
    
    //free
    for (i=0; i<triangleSize; ++i) {
        free(dp[i]);
    }
    free(dp);
    return ret;
}