package s03;
public class s03 {
public static void main(String[] args) {
int nums[] = {-2,1,-3,4,-1,2,1,-5,4};
System.out.println(findGreatestSumOfSubArray(nums,nums.length));
}
static boolean g_InvalidInput = false; //不合法输入
static int findGreatestSumOfSubArray(int[] nums,int nLength){
if (nums == null || nLength <= 0){
g_InvalidInput = true;
return 0;
}
g_InvalidInput = false;
int nCurSum = 0;
int nGreateSum = 0x80000000; //0x80000000是-2147483648,int的最小加权值。
//nCurSum是试探值,
//nGreateSum是比较后的结果值(最终值)
System.out.println("nums = {-2,1,-3,4,-1,2,1,-5,4} nLength=="+nLength);
for (int i = 0; i < nLength; i++) {
System.out.println("for (int i = 0; i < nLength; i++) { //i=="+i+",nums["+i+"]=="+nums[i]+",上一轮nCurSum=="+nCurSum);
//下面if else都是试探
//要么重新开始,要么继续累加
//⚠️注意:因为是遍历整个数组找出最大连续子序列和:所以遍历到nums[i]是一定是试探加上它的后果,也就是说你试探的序列一定是有nums[i]的,
//即①nCurSum累加到nums[i],②只有nums[i]
//不是说有nums[i]才会有最大和
//而是,试探序列有了nums[i]会不会比之前的计算过的子序列和大
//就是:我们遍历的路线要么这样【-2,1,-3】,要么是【-3,...】(当nums[i]==3时),即nCurSum即将更新为以上这两种,所以遍历下一个nums[i]==-4的时候还是连续的,
//如果子序列和小于等于0--->舍弃,令nums[i]为新的子序列和
if (nCurSum <= 0) {
System.out.println(" if (nCurSum <= 0) //上一轮子序列和nCurSum小于等于0--->舍弃,令nums[i]为新的子序列和");
nCurSum = nums[i];
System.out.println(" nCurSum = nums[i]; 【"+nCurSum+"】 //让nums[i]试探着成为新的nCurSum(看能不能比之前的累加过来的nCurSum大)");
System.out.println(" 不累加");
}
//如果已计算的子序列和大于0,则加上当前nums[i]
else {
System.out.println(" else { //上一轮子序列和nCurSum大于0,累加");
nCurSum += nums[i];
System.out.println(" nCurSum += nums[i] //nCurSum更新为"+nCurSum);
}
//无论是累加到当前nums[i]还是从当前nums[i]开始计算和,
//都要与nGreateSum比较
System.out.print("\n=================试探完进行比较---- nCurSum=="+nCurSum+",nGreateSum=="+nGreateSum);
System.out.println(",大于nGreateSum才更改。========================");
if (nCurSum > nGreateSum)
nGreateSum = nCurSum;
System.out.println(" nGreateSum = nCurSum; //nGreateSum更新为"+nGreateSum+"\n");
}
return nGreateSum;
}
}