# Enter a code
L = [95.5, 85, 59, 66, 72]
a=0
zh=0
n=len(L)
for i in range(n):
sw=False
for su in range(0,n-i-1):
T=0
if L[su+1]>=L[su]:
T=L[su+1]
L[su+1]=L[su]
L[su]=T
sw=True
if not sw:
break
print(L[0:3])
L = [95.5, 85, 59, 66, 72]
a=0
zh=0
n=len(L)
for i in range(n):
sw=False
for su in range(0,n-i-1):
T=0
if L[su+1]>=L[su]:
T=L[su+1]
L[su+1]=L[su]
L[su]=T
sw=True
if not sw:
break
print(L[0:3])
2024-11-18
names = ['Alice', 'Bob', 'Candy', 'David', 'Ellena']
name_set = set(names)
extend_set = set([])
for i in name_set:
extend_set.add(i.lower())
name = 'Bob'
new_name = name.lower()
if new_name in extend_set:
print('{} is in the class'.format(name))
else:
print("{} isn't in the class".format(name))
name_set = set(names)
extend_set = set([])
for i in name_set:
extend_set.add(i.lower())
name = 'Bob'
new_name = name.lower()
if new_name in extend_set:
print('{} is in the class'.format(name))
else:
print("{} isn't in the class".format(name))
2024-11-04
我的罪簡(jiǎn)單
li=[]
for i in range(1,101):
li.append(i*i)
print(sum(li))
li=[]
for i in range(1,101):
li.append(i*i)
print(sum(li))
2024-10-20
那么麻煩,先用keys(),在用len()
d = {'Alice': [50, 61, 66], 'Bob': [80, 61, 66], 'Candy': [88, 75, 90]}
>>>>>print(len(d.keys()))
d = {'Alice': [50, 61, 66], 'Bob': [80, 61, 66], 'Candy': [88, 75, 90]}
>>>>>print(len(d.keys()))
2024-10-19
d = {'Alice': [50, 61, 66], 'Bob': [80, 61, 66], 'Candy': [88, 75, 90]}
for key in d :
for value in d[key]:
print(key , value)
for key in d :
for value in d[key]:
print(key , value)
2024-10-19
d = {'Alice': 45,'Bob': 60,'Candy': 75,'David': 86,'Ellena': 49
}
if 'Alice' in d :
print(d['Alice'])
d['Alice']=60
print(d['Alice'])
else:
print("沒(méi)有")
}
if 'Alice' in d :
print(d['Alice'])
d['Alice']=60
print(d['Alice'])
else:
print("沒(méi)有")
2024-10-19
你們的都不行,要保留原數(shù)據(jù),看我的
d = {
'Alice': [45],'Bob': [60],'Candy': [75],
}
d['Alice']+=[50,61,66]
d['Bob']+=[80, 61, 66]
d['Candy']+=[88, 75, 90]
print (d)
d = {
'Alice': [45],'Bob': [60],'Candy': [75],
}
d['Alice']+=[50,61,66]
d['Bob']+=[80, 61, 66]
d['Candy']+=[88, 75, 90]
print (d)
2024-10-19
如果在看這個(gè)新輸出的元祖和舊元祖一樣嗎?明顯不一樣,基于元祖的不可變性質(zhì),兩個(gè)元祖的最后一個(gè)元素分別為可變的列表和不可變的元祖,這本來(lái)就是兩個(gè)元祖,
2024-10-19
大家的的想法是把可變的list修改為不可變的tuple,方法是的可行的。
但是最后輸出的tuple還是原來(lái)的tuple嗎?基于元祖的不可變,輸出的元祖,應(yīng)該是認(rèn)為是一個(gè)新的元祖,而非修改舊元祖而來(lái)的,
但是最后輸出的tuple還是原來(lái)的tuple嗎?基于元祖的不可變,輸出的元祖,應(yīng)該是認(rèn)為是一個(gè)新的元祖,而非修改舊元祖而來(lái)的,
2024-10-19
T = ((1+2), ((1+2),), ('a'+'b'), (1, ), (1,2,3,4,5))
評(píng)論區(qū)總有說(shuō)python縮進(jìn)看著難受的,說(shuō)用括號(hào)的一目了然,這叫一目了然?
我還是覺(jué)得縮進(jìn)比括號(hào)好用
評(píng)論區(qū)總有說(shuō)python縮進(jìn)看著難受的,說(shuō)用括號(hào)的一目了然,這叫一目了然?
我還是覺(jué)得縮進(jìn)比括號(hào)好用
2024-10-19