最大子序列和
来源:互联网 发布:qq空间刷留言软件 编辑:程序博客网 时间:2024/05/18 18:20
private static int MaximunSunsequenceSumMethod3(int[] testArr, int left, int right) {
if (left == right) {
if (testArr[left] > 0)
return testArr[left];
return 0;
}
int center = (left + right) / 2;
int maxLeftSum = MaximunSunsequenceSumMethod3(testArr, left, center);
int maxRightSum = MaximunSunsequenceSumMethod3(testArr, center + 1, right);
int maxLeftBorderSum = 0, leftBorderSum = 0;
for (int i = center; i >= left; i--) {
leftBorderSum += testArr[i];
if (leftBorderSum > maxLeftBorderSum)
maxLeftBorderSum = leftBorderSum;
}
int maxRightBorderSum = 0, rightBorderSum = 0;
for (int i = center + 1; i <= right; i++) {
rightBorderSum += testArr[i];
if (rightBorderSum > maxRightBorderSum)
maxRightBorderSum = rightBorderSum;
}
return max(maxLeftSum, maxRightSum, maxLeftBorderSum + maxRightBorderSum);
}
private static int max(int maxLeftSum, int maxRightSum, int sum) {
int max = sum;
if (maxLeftSum > max)
max = maxLeftSum;
if (maxRightSum > max)
max = maxRightSum;
return max;
}
private static void MaximunSunsequenceSumMethod1(int[] testArr) {
long start = System.currentTimeMillis();
int maxSum = 0;
for (int i = 0; i < testArr.length; i++) {
for (int j = i; j < testArr.length; j++) {
int thisSum = 0;
for (int k = 0; k < j; k++) {
thisSum += testArr[k];
}
if (thisSum > maxSum) {
maxSum = thisSum;
}
}
}
System.out.println(maxSum);
long end = System.currentTimeMillis();
System.out.println("time:" + (end - start) + "ms");
}
private static void MaximunSunsequenceSumMethod2(int[] testArr) {
long start = System.currentTimeMillis();
int maxSum = 0;
for (int i = 0; i < testArr.length; i++) {
int thisSum = 0;
for (int j = i; j < testArr.length; j++) {
thisSum += testArr[j];
if (thisSum > maxSum) {
maxSum = thisSum;
}
}
}
System.out.println(maxSum);
long end = System.currentTimeMillis();
System.out.println("time:" + (end - start) + "ms");
if (left == right) {
if (testArr[left] > 0)
return testArr[left];
return 0;
}
int center = (left + right) / 2;
int maxLeftSum = MaximunSunsequenceSumMethod3(testArr, left, center);
int maxRightSum = MaximunSunsequenceSumMethod3(testArr, center + 1, right);
int maxLeftBorderSum = 0, leftBorderSum = 0;
for (int i = center; i >= left; i--) {
leftBorderSum += testArr[i];
if (leftBorderSum > maxLeftBorderSum)
maxLeftBorderSum = leftBorderSum;
}
int maxRightBorderSum = 0, rightBorderSum = 0;
for (int i = center + 1; i <= right; i++) {
rightBorderSum += testArr[i];
if (rightBorderSum > maxRightBorderSum)
maxRightBorderSum = rightBorderSum;
}
return max(maxLeftSum, maxRightSum, maxLeftBorderSum + maxRightBorderSum);
}
private static int max(int maxLeftSum, int maxRightSum, int sum) {
int max = sum;
if (maxLeftSum > max)
max = maxLeftSum;
if (maxRightSum > max)
max = maxRightSum;
return max;
}
private static void MaximunSunsequenceSumMethod1(int[] testArr) {
long start = System.currentTimeMillis();
int maxSum = 0;
for (int i = 0; i < testArr.length; i++) {
for (int j = i; j < testArr.length; j++) {
int thisSum = 0;
for (int k = 0; k < j; k++) {
thisSum += testArr[k];
}
if (thisSum > maxSum) {
maxSum = thisSum;
}
}
}
System.out.println(maxSum);
long end = System.currentTimeMillis();
System.out.println("time:" + (end - start) + "ms");
}
private static void MaximunSunsequenceSumMethod2(int[] testArr) {
long start = System.currentTimeMillis();
int maxSum = 0;
for (int i = 0; i < testArr.length; i++) {
int thisSum = 0;
for (int j = i; j < testArr.length; j++) {
thisSum += testArr[j];
if (thisSum > maxSum) {
maxSum = thisSum;
}
}
}
System.out.println(maxSum);
long end = System.currentTimeMillis();
System.out.println("time:" + (end - start) + "ms");
}
阅读全文
0 0
- 最大子序列和
- 最大子序列和
- 最大和子序列
- 最大子序列和
- 最大子序列和
- 最大子序列和
- 最大子序列和
- 最大子序列和?
- 最大子序列和
- 最大子序列和
- 和最大子序列
- 最大子序列和
- 最大子序列和
- 最大子序列和
- 最大子序列和
- 最大子序列和
- 最大和子序列
- 最大子序列和
- glibc内存管理
- 设置Flume监听文件内容
- AIX的inittab分析报告
- http请求获取跳转后URL JAVA
- StarUML for MAC 破解方法
- 最大子序列和
- Android实战系列(一)---版本更新
- 利用Python进行数据分析(7) pandas基础: Series和DataFrame的简单介绍
- EJB深度剖析,写的蛮好的,拿来借鉴一下
- oracle的sql操作
- 黑白棋的基础程序
- leetcode Unique Binary Search Trees
- 一个完整的软件项目开发流程
- springmvc常用注解