mine.java

//matrix size -> n*m

int findMine(i, j){
  if(i < 0 || i > n){
    return -1;
  }
  if(j == (m-1)){
    return arr[i][j];
  }
  if(mem[i][j] == -1){
    maxVal = max(findMine(i-1, j+1),
                 findMine(i, j+1),
                 findMine(i+1, j+1));
    memTable[i][j] = arr[i][j] + maxVal;  
  }
  return memTable[i][j];
}