LintCode之44 最小子数组

public int minSubArray(ArrayList<Integer> nums) {
// write your code
int start=0,end=0,minsum=nums.get(0),nowsum=0;
while (end<nums.size()) {
if(nowsum>=0)
{
nowsum=nums.get(end);
end++;
start=end;
}else
{
nowsum+=nums.get(end);
end++;
}
if(nowsum<minsum)
minsum=nowsum;
}
return minsum;
}