Path with the smallest sum

Path with the smallest sum

Question:

Given the m * n matrix, each position is a non-negative integer. Starting from the upper left corner, you can only go to the right and bottom at a time and go to the lower right corner, but only once to find the path with the smallest sum.

Ideas:

Because it takes only one time, it is relatively simple, dp [0, 0] = a [0, 0], and dp [x, y] = min (dp [X-1, y] + a [x, y], dp [x, Y-1] + a [x, y]).

# Include

 
  
# Include

  
   
# Define min (x, y) (x) <(y )? (X) :( y) int getMinSumOfArray (int a [] [5], int row, int col) {int dp [100] [100]; int I; int j; dp [0] [0] = a [0] [0]; for (I = 1; I