Java中用于编码的TapeEquilibrium问题

public class TapeEquilibrium {
    public int solution(int[] A) {
        int totalSum = 0;
        int leftSum = 0;
        int minDiff = Integer.MAX_VALUE;

        // 计算数组的总和
        for (int num : A) {
            totalSum += num;
        }

        // 遍历数组，计算左右两侧的差值，并更新最小差值
        for (int i = 0; i < A.length - 1; i++) {
            leftSum += A[i];
            int rightSum = totalSum - leftSum;
            int diff = Math.abs(leftSum - rightSum);
            minDiff = Math.min(minDiff, diff);
        }

        return minDiff;
    }
}