如何在java中找到序列和最大的子数组？

public class MaxSubarraySum {
    public static void main(String[] args) {
        int[] nums = {1, -2, 3, 10, -4, 7, 2, -5};
        int maxSum = findMaxSubarraySum(nums);
        System.out.println("序列和最大的子数组的和为：" + maxSum);
    }

    public static int findMaxSubarraySum(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        int maxSum = dp[0];

        for (int i = 1; i < nums.length; i++) {
            if (dp[i - 1] > 0) {
                dp[i] = dp[i - 1] + nums[i];
            } else {
                dp[i] = nums[i];
            }
            maxSum = Math.max(maxSum, dp[i]);
        }

        return maxSum;
    }
}