摘要： package leetcode; public class offer_47 { public int maxValue(int[][] grid) { int hight=grid.length; int width=grid[0].length; int[][] dp=new int[high 阅读全文

摘要： package leetcode; public class offer_42 { public int maxSubArray(int[] nums) { //记录当前所经历子数组和的最大值 int maxnum=nums[0]; //记录当前所经历子数组和 int num=nums[0]; fo 阅读全文