329. 矩阵中的最长递增路径

int dict[4][2] = {
    {-1, 0},
    {0, -1},
    {1, 0},
    {0, 1}
};

int dfs(int **matrix, int **memo, int row, int col, int i, int j)
{
    if (memo[i][j])
        return memo[i][j];

    int tmp = 1;
    for (int k = 0; k < 4; k++) {
        int x = i + dict[k][0];
        int y = j + dict[k][1];
        if (x >= 0 && x < row && y >= 0 && y < col && matrix[x][y] > matrix[i][j]) {
            tmp = fmax(tmp, dfs(matrix, memo, row, col, x, y) + 1);
        }
    }
    memo[i][j] = tmp;
    return memo[i][j];
}

int longestIncreasingPath(int** matrix, int matrixSize, int* matrixColSize){
    if (matrix == NULL) {
        return 0;
    }
    
    int **memo = (int **)malloc(matrixSize * sizeof(int *));
    for (int i = 0; i < matrixSize; i++) {
        memo[i] = (int *)calloc(matrixColSize[0], sizeof(int));
    }
    
    int res = 0;
    for (int i = 0; i < matrixSize; i++) {
        for (int j = 0; j < matrixColSize[0]; j++) {
            res = fmax(res, dfs(matrix, memo, matrixSize, matrixColSize[0], i, j));
        }
    }
    
    for (int i = 0; i < matrixSize; i++) {
        free(memo[i]);
    }
    free(memo);
    return res;
}