给定一个整数数组,找到一个具有最小和的子数组。返回其最小和。
public class Solution { /* * @param nums: a list of integers * @return: A integer indicate the sum of minimum subarray */ public int minSubArray(List<Integer> nums) { // write your code here int min = Integer.MAX_VALUE, tmp = 0; for (int i = 0; i < nums.size(); i++) { if (tmp > 0) { tmp = nums.get(i); } else { tmp += nums.get(i); } if (tmp < min) { min = tmp; } } return min; } }