maximum subarray whose sum equals 0

Question

An array contains both positive and negative elements, find the maximum subarray whose sum equals 0.

Answer 1

An array contains positive and negative numbers. Find the sub-array that has the maximum sum

public static int findMaxSubArray(int[] array)
{
    int max=0,cumulativeSum=0,i=0,start=0,end=0,savepoint=0;
    while(imax)
        {
                max=cumulativeSum;
                savepoint=start;
                end=i;
        }
        i++;
    }

    System.out.println("Max : "+max+"  Start indices : "+savepoint+"  end indices : "+end);
    return max;

}