I know how to count the total number of paths from the top left of a matrix[0][0] to the bottom right matrix[m][n] but how could I count the total max paths from the top left to the bottom right (the sum of numbers that give the max value, and there's more than one)? I can only move right or down. Would I use a dynamic programming chart? Needs to be in Java.