數組最長子段和java實現

package Test; //計算數組的最大子段和 public class lcs { public static void main(String[] args) { int num[]={1,-2,3,10,-4,7,2,-5}; //int max=lcs_first(num); //int max=lcs_fenzhi(num, 0, num.length-1); int max=ge

>>阅读原文<<