我正在嘗試使用分而治之的 O(N) 解決方案來解決下一個問題：給定一個循環(huán)排序的數(shù)組，我需要它的正數(shù)之和。IE：If the array is: {-2, 0, 3, 4, 11, 13, -23, -15, -8}Then the algorithm should return 31.我認(rèn)為我已經(jīng)通過以下代碼接近它，但它奇怪地返回 -17 并且我無法找到問題調(diào)試：public class Main {private static final int[] TEST_VECTOR = new int[]{-2, 0, 3, 4, 11, 13, -23, -15, -8};public static int sumPositives2(int[] vector) {    return maximumSum(vector,0, vector.length - 1);}// Function to find Maximum subarray sum using// divide and conquerpublic static int maximumSum(int[] A, int left, int right){    // If array contains only one element    if (right == left) {        return A[left];    }    // Find middle element of the array    int mid = (left + right) / 2;    // Find maximum subarray sum for the left subarray    // including the middle element    int leftMax = Integer.MIN_VALUE;    int sum = 0;    for (int i = mid; i >= left; i--)    {        if(A[i] > 0) {            sum += A[i];        }    }    // Find maximum subarray sum for the right subarray    // excluding the middle element    int rightMax = Integer.MIN_VALUE;    sum = 0;    // reset sum to 0    for (int i = mid + 1; i <= right; i++)    {        if(A[i] > 0) {            sum += A[i];        }    }    // Recursively find the maximum subarray sum for left    // subarray and right subarray and tale maximum    int maxLeftRight = maximumSum(A, left, mid) +            maximumSum(A, mid + 1, right);    // return maximum of the three    return maxLeftRight + leftMax + rightMax;}public static void main(String[] args){    System.out.println("The Maximum sum of the subarray is " +            maximumSum(TEST_VECTOR, 0, TEST_VECTOR.length - 1));//Should be 31}}編輯：這個解決方案是 O(N) 嗎？感謝您的時間。