qfgg3的专栏

function decompose(n) { var rest=n* n, cur= n-1, result1=[], rec=[]; rest = find(rest,cur, rec); if( rest==0 ) { return rec.reverse(); } var len=rec.length, top, subPath=[]; for(va