Python：每日一题 196

冬雪雪冬 · 发表于 2018-8-10 10:46:40

马上注册，结交更多好友，享用更多功能^_^

您需要登录才可以下载或查看，没有账号？立即注册

x

本帖最后由冬雪雪冬于 2018-8-12 12:33 编辑

我们的玩法做了一下改变：

1. 楼主不再提供答案。
2. 请大家先独立思考，再参考其他鱼油的解答，这样才有助于自己编程水平的提高。开始阶段是看不到其他人的回帖的，等答题完成，开始评分时再取消限制。
3. 鼓励大家积极答题，奖励的期限为出题后24小时内。
4. 根据答案的质量给予1~3鱼币的奖励。

题目：
帕斯卡三角形（杨辉三角）大家都很熟悉。即每新的一行的每个数等于它上方两数之和，并在左右两端各增加一个1

我们很容易编写一个函数实现，如：

>>> tri(10)
1
1, 1
1, 2, 1
1, 3, 3, 1
1, 4, 6, 4, 1
1, 5, 10, 10, 5, 1
1, 6, 15, 20, 15, 6, 1
1, 7, 21, 35, 35, 21, 7, 1
1, 8, 28, 56, 70, 56, 28, 8, 1
1, 9, 36, 84, 126, 126, 84, 36, 9, 1

复制代码

这里把规则稍做改变，两端各自增加的不是1，而是上一行最大的数，即得到这样的结果：

>>> tri(10)
1
1, 1
1, 2, 1
2, 3, 3, 2
3, 5, 6, 5, 3
6, 8, 11, 11, 8, 6
11, 14, 19, 22, 19, 14, 11
22, 25, 33, 41, 41, 33, 25, 22
41, 47, 58, 74, 82, 74, 58, 47, 41
82, 88, 105, 132, 156, 156, 132, 105, 88, 82

复制代码

塔利班 · 发表于 2018-8-10 11:13:44

本帖最后由塔利班于 2018-8-10 11:23 编辑

def fun196(x):
L=[1]
print(1)
for i in range(2,x+1):
a=max(L)
b=[L[k]+L[k+1] for k in range(i-2)]
L=[a]+b+[a]
print(str(L).strip('[]'))

复制代码

凌九霄 · 发表于 2018-8-10 11:20:02

本帖最后由凌九霄于 2018-8-10 12:17 编辑

def triangles():
N = [ 1 ]
while True:
yield N
N.append(0)
N = [ N[ i - 1 ] + N[ i ] for i in range(len(N)) ]
n = 0
maxv = 1
for i in triangles():
i[ 0 ], i[ len(i) - 1 ] = maxv, maxv
print(i)
maxv = max(i)
n = n + 1
if n == 10:
break

复制代码

小Q学Python · 发表于 2018-8-10 11:36:08

def tri(n):
print('1\n1, 1')
a = [1, 1]
for i in range(1, n-1):
b =[max(a)]+ [a[i]+a[i+1] for i in range(len(a)-1)] +[max(a)]
print(', '.join([str(i) for i in b]))
a = b
tri(10)

复制代码

JessiFly · 发表于 2018-8-10 12:54:07

def tri(n):
result = []
for i in range(n):
temp = []
if i == 0:
result.append([1])
elif i == 1:
result.append([1,1])
else:
for j in range(i+1):
if j == 0 or j == i:
temp.append(max(result[i-1]))
else:
temp.append(result[i-1][j-1]+result[i-1][j])
result.append(temp)
#逐行打印
for each in result:
for index in range(len(each)):
if index != len(each) - 1:
print(each[index],end = ', ')
else:
print(each[index])

复制代码

>>> tri(10)
1
1, 1
1, 2, 1
2, 3, 3, 2
3, 5, 6, 5, 3
6, 8, 11, 11, 8, 6
11, 14, 19, 22, 19, 14, 11
22, 25, 33, 41, 41, 33, 25, 22
41, 47, 58, 74, 82, 74, 58, 47, 41
82, 88, 105, 132, 156, 156, 132, 105, 88, 82

复制代码

archlzy · 发表于 2018-8-10 13:00:41

本帖最后由 archlzy 于 2018-8-10 14:05 编辑

def tri(num):
def temp_tri(num):
if num == 1:
return [1]
temp_list = temp_tri(num-1)
temp_list.append(0)
temp_list = [temp_list[i-1] + temp_list[i] for i in range(len(temp_list))]
temp_list[0] = temp_list[len(temp_list)-1] = max(temp_tri(num-1))
return temp_list
for i in range(num):
print(str(temp_tri(i+1)).strip("[]"))

复制代码

祥哥威武 · 发表于 2018-8-10 13:06:03

def triangle(num0):
if num0 < 1:
return 0
list1 = [1]
list2 = []
print(list1)
if num0 == 1:
return 0
for i in range(num0-1):
list2.append(max(list1))
if i > 0:
for j in range(i):
if j != i:
list2.append(list1[j] + list1[j + 1])
list2.append(max(list1))
print(list2)
list1 = list2
list2 = []
triangle(10)

复制代码

zhou995287902 · 发表于 2018-8-10 14:03:32

def fun(num):
a=''
nums1=[]
nums2=[1,1]
for i in range(1,num+1):
for ii in range(i):
if ii==0 or ii==i-1:
nums1.append(max(nums2))
else:
nums1.append(nums2[ii]+nums2[ii-1])
for each in nums1:
a+=str(each)+' '
print(a)
nums2=nums1
nums1=[]
a=''
fun(10)

复制代码

a641743376 · 发表于 2018-8-10 16:03:13

def tri(num):
list1=[1]
n=0
while True:
      tmp=''
      for i in range(len(list1)):
         if i==len(list1)-1:
            tmp+=str(list1[i])
         else:
            tmp+=str(list1[i])+','
      print(tmp)
      n=n+1
      if n==num:
         break
      list2=list1[:]
      list1=[((list1+[0])[i]+([0]+list1)[i])for i in range(len(list1)+1)]
      tmp1=max(list2)
      list1[0]=tmp1
      list1[-1]=tmp1

天圆突破 · 发表于 2018-8-10 16:08:33

本帖最后由天圆突破于 2018-8-10 16:09 编辑

def func196(n=0):
result, lst, j = [], [1], 1
while True:
result.append(lst)
print(lst)
if j == n:break
j += 1
lst = [None for i in range(len(result)+1)]
lst[0] = lst[-1] = max(result[-1])
if len(lst) > 2:
for i in range(len(result[-1])-1):
lst[i+1] = result[-1][i] + result[-1][i+1]
func196(10)

复制代码

grf1973 · 发表于 2018-8-10 16:08:36

def tri(x):
if x==1:
return 1
res=[[1],[1,1]]
for i in range(2,x):
mx=max(res[i-1])
res.append([mx])
for j in range(i-1):
res[i].append(res[i-1][j]+res[i-1][j+1])
res[i].append(mx)

s=''
for k in res:
s+='\n'+str(k)[1:-1]
return s[1:]

print(tri(10))

小木子c · 发表于 2018-8-10 16:08:46

def fun196(num):
list0 = [[1],[1,1]]
for i in range(2,num):
list1 = []
for j in range(len(list0[i-1])-1):
list1.append(list0[i-1][j]+list0[i-1][j+1])
list1.insert(0,max(list0[i-1]))
list1.append(max(list0[i-1]))
list0.append(list1)
for each in list0:
print(','.join(map(str,each)))
>>> fun196(10)
1
1,1
1,2,1
2,3,3,2
3,5,6,5,3
6,8,11,11,8,6
11,14,19,22,19,14,11
22,25,33,41,41,33,25,22
41,47,58,74,82,74,58,47,41
82,88,105,132,156,156,132,105,88,82
>>>

复制代码

晓屁屁 · 发表于 2018-8-10 16:53:12

def Good(num):
list1 = []
for x in range(num):
list1.append(list())
for y in range(len(list1)):
list1[x].append(1)
for x in range(2,num):
for y in range(1,x):
list1[x][y] = list1[x-1][y-1]+list1[x-1][y]
for x in range(3,num):
list1[x][x] = max(list1[x-1])
list1[x][0] = list1[x][x]
for x in range(3,num):
for y in range(1,x):
list1[x][y] = list1[x-1][y-1]+list1[x-1][y]
list1[x][x] = max(list1[x - 1])
list1[x][0] = list1[x][x]
for x in range(len(list1)):
print(','.join([str(i) for i in list1[x]]))
Good(10)

复制代码

CC柴 · 发表于 2018-8-10 17:29:11

def tri(n):
list1 = [1]
for i in range(n):
yield list1
list1 = [max(list1)] + [list1[j] + list1[j+1] for j in range(len(list1)-1)] + [max(list1)]
for x in tri(10):
print(x)

复制代码

拉了盏灯 · 发表于 2018-8-10 19:18:47

我忘了windows的return会不会显示，但好像linux不行，如果重复的话就把print删掉就OK了。
def tri(num):
if num == 1:
print([1])
return [1]
else:
l = tri(num -1)
if num - 2 == 0:
print([1,1])
return [1,1]
else:
lst = [max(l)]
count = 1
while num - 1 > count:
lst.append(l[count - 1] + l[count])
count += 1
lst.append(max(l))
print(lst)
return lst

tri(10)

776667 · 发表于 2018-8-10 20:40:25

def fun196(x):
line_1 = [1]
line_2 = []
for length in range(1,x+1):
if length == 1:
print('1')
continue
else:
for j in range(length):
if j == 0 or j == length-1:
line_2.append(str(max(line_1)))
else:
line_2.append(str(line_1[j-1]+line_1[j]))
print(','.join(line_2))
line_1 = [int(i) for i in line_2]
line_2 = []

复制代码

久疤K · 发表于 2018-8-10 20:48:39

>>> def yh(func=None):
func = func if func else lambda x:1
r = [1]
while True:
yield r
m = func(r)
r = [m] + [r[i]+r[i-1] for i in range(1,len(r))] + [m]
>>> def tri( n =10 ):
r = yh(max)
for i in range(n):
print(str(next(r))[1:-1])
>>> tri(10)
1
1, 1
1, 2, 1
2, 3, 3, 2
3, 5, 6, 5, 3
6, 8, 11, 11, 8, 6
11, 14, 19, 22, 19, 14, 11
22, 25, 33, 41, 41, 33, 25, 22
41, 47, 58, 74, 82, 74, 58, 47, 41
82, 88, 105, 132, 156, 156, 132, 105, 88, 82
>>>

复制代码

久疤K · 发表于 2018-8-10 21:10:06

话说，怎样证明每一行中仍然是：越靠近中间，数值越大呢？

zxz-python · 发表于 2018-8-10 22:11:02

def tri(value):
dat1 = [1] #用于存储前一行的数据
dat2 = [1] #用于存储新的数据
print('1')
for i in range(2, value+1): #i代表第i行
dat1 = dat2
dat2 = [max(dat1)]
for j in range(1, i-1): # j代表第i行的第j个数
dat2.append(dat1[j-1] + dat1[j])
dat2.append(max(dat1))
for each in dat2[:-1]:
print(each, end=', ')
print('%d' % dat2[-1])

复制代码

269662667 · 发表于 2018-8-11 00:06:38

def tri(num):
      def __add(L):
            P = L
            L = [1] + [ P[i] + P[i+1] for i in range(len(P) - 1)] + [1]
            print('  '*(num - len(P)),end='')
            for i in L :
                     print(i,end=', ')
            print('\n')
            return L

      print('  ' * (num-1),'1 \n')
      if num > 1:
            L = [1,1]
            print('  '*(num - 2),"1, 1 \n")
            for n in range(2,num):
                     L = __add(L)



tri(10)

账号		自动登录	找回密码
密码			立即注册

[技术交流] Python：每日一题 196

马上注册，结交更多好友，享用更多功能^_^

本帖被以下淘专辑推荐:

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分

评分