Maximum sum of a sub-array

MaxSubArray.java

//Given an integer array nums,
//find the contiguous subarray (containing at least one number)
//which has the largest sum and return its sum.

class Solution {
    public int maxSubArray(int[] nums) { 
        if (nums.length == 1)
            return nums[0];

        int sum = 0;
        int answer = nums[0]; //Initial value of #ans is first element of array
        for (int value : nums) {
            if (value > sum && sum < 0)
                sum = value;//The beginning of sub-array
            else
                sum += value;
            answer = Math.max(answer, sum);
        }
        return answer;
    }
}

The overal algorithm seems correct and with log(N) complexity.
I am not sure if you need to do the checking for the specific case of positive values. Can you please remove that part and give it a try?
Try to minimize the code.