package leetcode.easy;

public class MaximumSubarray {

	@org.junit.Test

	public void test() {

		int[] nums = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };

		System.out.println(maxSubArray(nums));

	}

	public int maxSubArray(int[] nums) {

		int max = nums[0];

		int count = 0;

		for (int i = 0; i < nums.length; i++) {

			if (nums[i] > max) {

				max = nums[i];

			}

			count = nums[i];

			for (int j = i + 1; j < nums.length; j++) {

				count += nums[j];

				if (count > max) {

					max = count;

				}

			}

		}

		return max;

	}

}