暴力求解得了只40分
思路是当输入n之后,一层一层的遍历杨辉三角,一层没找到就往下一层找,直到找到为止
def yanghui(n):
triangle=[]
for i in range(n):
cur = [1]
triangle.append(cur)
if i ==0 :
continue
pre = triangle[i-1]
for j in range(i-1):
cur.append(pre[j]+pre[j+1])
cur.append(1)
return triangle
from itertools import chain
n=int(input())
i=0
while True:
a=yanghui(i)
a=list(chain.from_iterable(a))
if(a.count(n)>=1):
print(a.index(n)+1)
break
else:
i=i+1