算法导论第四章练习

最新推荐文章于 2023-08-02 16:30:11 发布

sscout

最新推荐文章于 2023-08-02 16:30:11 发布

阅读量1.9k

点赞数 4

分类专栏：算法导论

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

版权

算法导论专栏收录该内容

10 篇文章 1 订阅

订阅专栏

4.1练习

4.1-1

返回的是数组中最大元素的下标和值

4.1-2

public static int[] violenceFindMaximumSubarray(int[] arr) {
		int sum = Integer.MIN_VALUE; //this variable is made for the max sum of outer loop
		int tempSum = 0;    //this variable is made for temporary sum after each iteration
		int leftIndex = 0;
		int rightIndex = 0; 
		
		for(int i = 0;i < arr.length;i++) {
			tempSum = 0;
			for(int j = i;j < arr.length;j++) {
				tempSum += arr[j];
				if(tempSum > sum) {
					sum = tempSum;
					leftIndex = i;
					rightIndex = j;
				}
			}
		}
		
		return new int[] {leftIndex,rightIndex,sum};
	}

4.1-3

递归算法实现

https://blog.csdn.net/sscout/article/details/80984832

暴力算法实现在4.1-2已经实现

当n0<30时采用暴力算法，其他情况采用分治算法

修改：只需要在分治算法开始时再加上一个判断数组的长度是否小于30，如果小于30，就调用暴力算法

不会改变性能交叉点

4.1-4

public static int[] findMaxCrossingSubarray(int[] arr,int low,int mid,int high) {
		int leftSum = 0;
		int rightSum = 0;
		int sum = 0;
		int maxLeft = mid;
		int maxRight = mid;
		
		for(int i = mid;i >= low;i--) {
			sum += arr[i];
			if(sum > leftSum) {
				leftSum = sum;
				maxLeft = i;
			}
		}
		
		sum = 0;
		for(int j = mid+1;j <= high;j++) {
			sum += arr[j];
			if(sum > rightSum) {
				rightSum = sum;
				maxRight = j;
			}
		}
		
		if(leftSum+rightSum < 0) {
			return new int[] {-1,-1,0};
		}
		return new int[] {maxLeft,maxRight,leftSum+rightSum};
	}

public static int[] findMaximumSubarray(int[] arr,int low,int high) {
		if(high == low) {
			if(arr[0] < 0) {
				return new int[] {-1,-1,0};
			}
			return new int[] {low,high,arr[0]};
		}else {
			int mid = (low + high)/2;
			int[] leftResult = findMaximumSubarray(arr,low,mid);
			int[] rightResult = findMaximumSubarray(arr,mid+1,high);
			int[] crossResult = findMaxCrossingSubarray(arr,low,mid,high);
			
			if(leftResult[2] >= rightResult[2] && leftResult[2] >= crossResult[2]) {
				return leftResult;
			}else if(rightResult[2] >= leftResult[2] && rightResult[2] >= crossResult[2]) {
				return rightResult;
			}else{
				return crossResult;
			}
		}
		
	}

4.1-5

public static int[] findMaximumSubarrayByMaximumSubarray(int[] arr,int low,int high) {
		int subSum = 0;
		int sum = 0;
		int leftIndex = high + 1;

		for(int i = low;i <= high;i++) {
			subSum += arr[i];
		}
		
		if(subSum + arr[high+1] < subSum) {
			return new int[] {low,high,subSum};
		}else {
			for(int j = high+1;j >= low;j--) {
				sum += arr[j];
				if(sum > subSum) {
					subSum = sum;
					leftIndex = j;
				}
			}
		}
		
		return new int[] {leftIndex,high+1,subSum};
		
		
	}