|
发表于 2018-3-9 22:19:07
|
显示全部楼层
本帖最后由 t6am3 于 2018-3-9 22:36 编辑
#第一种:
def triangle(n, N):
base = 65
print(' '*(N-n), end='');
stack = []
for i in range(n):
t = base+(i%26)
print('%c'% t, end='')
if i != n-1:
stack.append('%c'%t)
stack.reverse()
for eachletter in stack:
print(eachletter, end='')
print('')
def fun(n):
for i in range(1, n+1):
triangle(i, n)
#第二种好像简单一点点?……:
def triangle(n, N):
print(' '*(N-n), end='')
Stack = list((range(n)))
for i in Stack:
print('%c'%(65+i%26), end='')
Stack.pop()
Stack.reverse()
for i in Stack:
print('%c'%(65+i%26), end='')
print('')
def fun(n):
for i in range(1, n+1):
triangle(i, n) |
评分
-
查看全部评分
|