完全二叉树个数问题intTotal(intn){intsum=0;if(n==1)return1;else{for(inti=1;i0)if(SUM[n-i]>0)sum+=SUM[i]*SUM[n-i];elsesum+=SUM[i]*Total(n-i);}}SUM[n]=sum;return