Lintcode: Minimum Subarray

Given an array of integers, find the subarray with smallest sum.

Return the sum of the subarray.

Have you met this question in a real interview? Yes
Example
For [1, -1, -2, 1], return -3

Note
The subarray should contain at least one integer.

 public class Solution {
     /**
      * @param nums: a list of integers
      * @return: A integer indicate the sum of minimum subarray
      */
     public int minSubArray(ArrayList<Integer> nums) {
         // write your code
         int local = nums.get(0);
         int global = nums.get(0);
         for (int i=1; i<nums.size(); i++) {
             local = Math.min(local+nums.get(i), nums.get(i));
             global = Math.min(local, global);
         }
         return global;
     }
 }