摘要：子数组和//Algorithm 1:时间效率为O(n*n*n) int MaxSubsequenceSum1(const int A[],int N) { int ThisSum=0 ,MaxSum=0,i,j,k; for(i=0;iMaxSum) MaxSum=ThisSum; } return MaxSum; } //Algorithm 2:时间效率为O(n*n) int MaxSubsequenceSum2(const int A[],int N) { int Thi... 阅读全文

摘要：public string returnResult(long num){ string numStr=num.ToString(); if(numStr.Length>8 && numStr.Length4) { string[] split=new string[2]; split[0]=str.Substring(0,str.Length-4); split[1]=str.Substring(str.length-4,4); string result1=getRe(split[0]); string... 阅读全文