思路很棒，我用python重写的，只通过百分之33 啊 res=[] if tsum <0: return res n=2 while (n*n+1<=2*tsum): x0 = (2 *tsum + n - n ** 2) / (2 * n) if math.floor(x0)==x0: x0=math.floor(x0) #那么这个就是要的答案 templist=[] for i in range(n): templist.append(x0+i) res.append(templist) n+=1 res2 = [] for item in range(len(res)): res2.append(res.pop()) return res2