#1
L = [95, 85, 59]
print L[-1]
print L[-2]
print L[-3]
#2
L = [95.5, 85, 59]
print L[-1]
print L[-2]
print L[-3]
print L[-4]
#3
L = [95.5, 85, 59]
print L[-1]
print L[-2]
print L[-4]
#4
L = [95.5, 85, 59]
print L[-1]
print L[-3]
print L[-4]
#5
L = [95.5, 85, 59]
print L[-2]
print L[-3]
print L[-4]
L = [95, 85, 59]
print L[-1]
print L[-2]
print L[-3]
#2
L = [95.5, 85, 59]
print L[-1]
print L[-2]
print L[-3]
print L[-4]
#3
L = [95.5, 85, 59]
print L[-1]
print L[-2]
print L[-4]
#4
L = [95.5, 85, 59]
print L[-1]
print L[-3]
print L[-4]
#5
L = [95.5, 85, 59]
print L[-2]
print L[-3]
print L[-4]
2017-03-07
已采纳回答 / 慕粉0040195199
这样就少了10个数。。。W=range(1,10)X=range(0,10)L=[]for m in W: for n in X: for p in W: if m==p: L.append(100*m+10*n+p)print L
2017-03-07
def toUppers(L):
return [x.upper() for x in L if isinstance(x,str)]
print toUppers(['Hello', 'world', 101])
return [x.upper() for x in L if isinstance(x,str)]
print toUppers(['Hello', 'world', 101])
sum = 0
x = 1
n = 1
while True:
sum += x
x = x * 2
n += 1
if n > 20:
break
print sum
x = 1
n = 1
while True:
sum += x
x = x * 2
n += 1
if n > 20:
break
print sum
2017-03-07
def move(n, a, b, c):
if n >= 2:
move(n-1,a,c,b)
move(1,a,b,c)
move(n-1,b,a,c)
else:
print a+" --> "+c
move(4, 'A', 'B', 'C')
if n >= 2:
move(n-1,a,c,b)
move(1,a,b,c)
move(n-1,b,a,c)
else:
print a+" --> "+c
move(4, 'A', 'B', 'C')
2017-03-07
d = {
'Adam': 95,
'Lisa': 85,
'Bart': 59
}
print 'Adam:'d['Adam']
print 'Lisa:'d['Lisa']
print 'Bart:'d['Bart']
'Adam': 95,
'Lisa': 85,
'Bart': 59
}
print 'Adam:'d['Adam']
print 'Lisa:'d['Lisa']
print 'Bart:'d['Bart']
2017-03-07
d = {
'Adam': 95,
'Lisa': 85,
'Bart': 59
}
print d['Adam']
print d['Lisa']
print d['Bart']
'Adam': 95,
'Lisa': 85,
'Bart': 59
}
print d['Adam']
print d['Lisa']
print d['Bart']
2017-03-07