《求最大子数组的JAVA源程序》由会员分享，可在线阅读，更多相关《求最大子数组的JAVA源程序（2页珍藏版）》请在装配图网上搜索。
1、文档供参考，可复制、编制，期待您的好评与关注！ public class MaximumSubarraypublic static int findMaxCossingSubarray(int A,int low,int mid,int hight)int leftsum=-0xffffff;int sum=0;int maxlift=0;for(int i=mid;i=low;i-)sum=sum+Ai;if(leftsumsum)leftsum=sum;maxlift=i;int rightsum=-0xffffff;sum=0;int maxright=0;for(int j=mid+1
2、;j=hight;j+)sum=sum+Aj;if(rightsumrightresult2 & leftresult2cossingresult2)return leftresult;else if(rightresult2leftresult2 & rightresult2cossingresult2)return rightresult; elsereturn cossingresult;public static void main(String args)/int A=13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7;int A=-13,-3,-25,-20,-3,-16,-23,-18,-20,-7,-12,-5,-22,-15,-4,-7;int finalresult=0,0,0;System.out.println(初始化是+finalresult0+ +finalresult1+ +finalresult2);finalresult= findMsximunSubarray(A,0,A.length-1);System.out.println(结果是+finalresult0+ +finalresult1+ +finalresult2);return;2 / 2
求最大子数组的JAVA源程序
