def getTriangularArrangement(n):
t = math.sqrt(n);
if t != math.floor(t):
return []
arrangement = []
i = 1
while n>0:
arrangement.append(i)
n-=i
i+=2
return [{'hex':False,'rows':arrangement,'type':'triangular'}]
评论列表
文章目录