Find maximum sum in slices (subsequences) of an array in Java

MaxSliceSum.java

public class MaxSliceSum {
    public int solution(int[] A) {
        int ans = A[0], sum = 0;
        for (int i = 0; i < A.length; i++) {
            if (sum > 0) {
                sum += A[i];
            } else {
                sum = A[i];
            }
            ans = Math.max(ans, sum);
        }
        return ans;
    }
}