查找数组中和最大的连续子序列，并优先选择最长的子序列

import java.util.ArrayList;
import java.util.List;

public class MaxSubsequence {

    public static void main(String[] args) {
        List<Integer> list = new ArrayList<>();
        list.add(1);
        list.add(2);
        list.add(-5);
        list.add(6);
        list.add(-3);
        list.add(-13434);
        list.add(99);
        list.add(99);
        list.add(-444);
        list.add(-7444);
        list.add(100);
        list.add(90);
        list.add(8);

        if (list == null || list.isEmpty()) {
            System.out.println("empty array");
            return;
        }

        int maxSumStartIndex = 0;
        int maxSumLastIndex = 0;
        int maxSum = list.get(0);
        int maxSumLength = 1; // 初始化长度为1

        int lastSumStartIndex = 0;
        int lastSum = list.get(0);

        for (int i = 1; i < list.size(); i++) {
            // 如果当前元素比累加和更大，则从当前元素开始新的子序列
            if (lastSum < list.get(i)) {
                lastSum = list.get(i);
                lastSumStartIndex = i;
            } else {
                lastSum += list.get(i);
            }

            int currentLength = i - lastSumStartIndex + 1;

            // 如果当前子序列的和大于最大和，则更新最大和子序列
            if (lastSum > maxSum) {
                maxSumStartIndex = lastSumStartIndex;
                maxSumLastIndex = i;
                maxSumLength = currentLength;
                maxSum = lastSum;
            } else if (lastSum == maxSum && currentLength > maxSumLength) {
                // 如果当前子序列的和等于最大和，但长度更长，则更新最大和子序列
                maxSumStartIndex = lastSumStartIndex;
                maxSumLastIndex = i;
                maxSumLength = currentLength;
            }
        }

        System.out.println("sum( arr[" + maxSumStartIndex + "] .. arr[" + maxSumLastIndex + "] ) = " + maxSum);
        System.out.print("Subsequence: ");
        for (int i = maxSumStartIndex; i <= maxSumLastIndex; i++) {
            System.out.print(list.get(i) + " ");
        }
        System.out.println();
    }
}