算法导论第四章笔记

最新推荐文章于 2023-04-27 23:34:50 发布

sscout

最新推荐文章于 2023-04-27 23:34:50 发布

阅读量195

点赞数

本文链接：https://blog.csdn.net/sscout/article/details/81990390

版权

4.1笔记

找出数组中的最大子数组采用分治方法实现

用Java代码实现

public static int[] findMaxCrossingSubarray(int[] arr,int low,int mid,int high){  // low是最小的数组索引下标，high是最大的数组索引下标
        int sum = 0;
        int leftSum = 0;
        int maxLeftIndex = 0;
        for (int i = mid;i >= low;i--){
            sum += arr[i];
            if(sum > leftSum){
                leftSum = sum;
                maxLeftIndex = i;
            }
        }

        int rightSum = 0;
        sum = 0;
        int maxRightIndex = 0;
        for(int j = mid +1;j <= high;j++){
            sum += arr[j];
            if(sum > rightSum){
                rightSum = sum;
                maxRightIndex = j;
            }
        }
        return new int[] {maxLeftIndex,maxRightIndex,leftSum+rightSum};
    }

public static int[] findMaximumSubarray(int[] arr,int low,int high){
        if(high == low){    //判断该数组是否只有一个元素
            return new int[]{low,high,arr[low]};
        }else{
            int mid = (low + high)/2;
            int[] leftMaxArr = findMaximumSubarray(Arrays.copyOfRange(arr,0,mid+1),0,mid);
            int[] rightMaxArr = findMaximumSubarray(Arrays.copyOfRange(arr,mid+1,high+1),0,arr.length-mid-2);
            int[] crossMaxArr = findMaxCrossingSubarray(arr,low,mid,high);
            if(leftMaxArr[2] >= rightMaxArr[2] && leftMaxArr[2] >= crossMaxArr[2]){
                return leftMaxArr;
            }else if(rightMaxArr[2] >= leftMaxArr[2] && rightMaxArr[2] >= crossMaxArr[2]){
                return rightMaxArr;
            }else{
                return  crossMaxArr;
            }
        }
    }