53.最大子序和
class Solution { public int maxSubArray(int[] nums) { int pre = 0, maxAns = nums[0]; for (int x : nums) { pre = Math.max(pre + x, x); maxAns = Math.max(maxAns, pre); } return maxAns; } }
public class Test { public static int cal(int[] nums) { int sum=0; for(int x:nums){ sum+=x; } return sum; } public static void main(String args[]){ int[] nums={1,2,3,4,5}; System.out.println(cal(nums)); } } //返回15
for (int i=0; i<b.length ;i++ ){ for (int i=0; i<b.length ;i++ ) { System.out.print(b[i] + " "); } for (int a:b) { System.out.print(a + " "); } }