算法导论——最大子数组

import java.util.Arrays;

import sun.applet.Main;


public class MaxSubArray {
	private final static int MAX_VALUE = 10;  
    private final static int LENGTH = 20; 
	
	private static class Result {
		int maxLeft;
		int maxRight;
		int sum;
	}
	
	public static void main(String[] args) {
		int[] A = new int[LENGTH];
		randomIntArray(A);
		
		Result r = maxSubArray(A, 0, A.length - 1);
		
		int[] P = Arrays.copyOfRange(A, r.maxLeft, r.maxRight + 1);
		System.out.println(Arrays.toString(A));
		System.out.println(Arrays.toString(P));
	}
	
    private static void randomIntArray(int[] array) {  
        if(array == null) return;  
        for(int i = 0; i < array.length; i++) {  
        	int pow =  (int)(Math.random()*2) + 1;
            array[i] = ((int)(Math.pow(-1, pow))) * 
            			((int) (Math.random() * MAX_VALUE));  
        }  
    }
    
	private static Result findMaxCrossSubArray(int[] A, int l, int m, int r) {
		int sum = 0;
		int leftSum = A[m], rightSum = A[m+1];
		
		Result result = new Result();
		result.maxLeft = m;
		result.maxRight = m + 1;
		
		for(int i = m; i > l-1; i--) {
			sum += A[i];
			if(sum > leftSum) {
				leftSum = sum;
				result.maxLeft = i;
			}
		}
		
		sum = 0;
		
		for(int i = m+1; i < r + 1; i++) {
			sum += A[i];
			if(sum > rightSum) {
				rightSum = sum;
				result.maxRight = i;
			}
		}
		result.sum = leftSum + rightSum;
		return result;
	}
	
	public static Result maxSubArray(int[] A, int l, int r) {
		Result result = new Result();
		result.maxLeft = l;
		result.maxRight = r;
		result.sum = A[l];
		
		if(l == r) {
			return result;
		} else {
			int m = (l + r) / 2;
			Result leftResult = maxSubArray(A, l, m);
			Result rightResult =  maxSubArray(A, l, m);
			Result crossResult = findMaxCrossSubArray(A, l, m, r);
			if(leftResult.sum >= rightResult.sum && 
					leftResult.sum >= crossResult.sum) {
				return leftResult;
			} else if(rightResult.sum >= leftResult.sum && 
						rightResult.sum >= crossResult.sum) {
				return rightResult;
			} else return crossResult;		 
		}
	}
	
}















  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值