求矩阵对角线的路径最大值。(右一个和下一个的比较)public class Solution {/*** 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可** @param matrix int整型二维数组* @return int整型*/public int maxValue (int[][] matrix) {// write code hereint sum = 0,tm = 0,tn = 0;int m = matrix.length,n = matrix[0].length;sum = matrix[0][0] + matrix[m-1][n-1];int i=0,j=0;while (i < m || j < n){if (i+1 >= m || j+1 >= n) break;if (matrix[i][j+1] > matrix[i+1][j]){sum += matrix[i][j+1];j++;}else {sum += matrix[i+1][j];i++;}}return sum;}}