作業
-
有如下值集合
[11,22,33,44,55,66,77,88,99,90...]
,將所有大於 66 的值保存至字典的第一個key中,將小於 66 的值保存至第二個key的值中,結果為{'k1': 大於66的所有值, 'k2': 小於66的所有值}
。kema = {11 ,22 ,33 ,44 ,55 ,66 ,77 ,88 ,99 ,99 ,90} kee = {'k1':[] ,'k2':[]} for i in kema: if i> 66: kee['k1'].append(i) else: kee['k2'].append(i) print(kee) 有難度 第二種答案:自己搜集的答案 li =[11,22,33,44,55,66,77,88,99,90] dic={} list_1 =[] #大於66 list_2 =[] #小於66 for i in li: if i ==66: continue if i > 66: list_1.append(i) else: list_2.append(i) dic.setdefault('k1',list_1) dic.setdefault('k2',list_2) print(dic)
第三種答案:
lis = [11,22,33,44,55,66,77,88,99,90]
dic = dict()
dic['k1'] = list()
dic['k2'] = list()
print(dic)
for i in lis:
if i > 66:
dic['k1'].append(i)
elif i < 66:
dic['k2'].append(i)
print(dic)
1. 統計`s='hello jason tank tank jason sean say hello dsb dsb sb'`中每個單詞的個數,結果為`{'hello': 2, 'alex': 2, 'say': 1, 'sb': 2}`。
```python
s='hello jason tank tank jason sean say hello dsb dsb sb'
s = s.split( )
kee = {}
for key in s:
if key in kee:
kee[key] += 1
else:
kee[key] = 1
print(kee)
- 有如下兩個集合,pythons是報名python課程的學員名字集合,linuxs是報名linux課程的學員名字集合
pythons={'alex','egon','yuanhao','wupeiqi','gangdan','biubiu'}
linuxs={'wupeiqi','oldboy','gangdan'}
1. 求出即報名python又報名linux課程的學員名字集合
2. 求出所有報名的學生名字集合
3. 求出只報名python課程的學員名字
4. 求出沒有同時這兩門課程的學員名字集合
print(pythons&linuxs) # print(f"{pythons.intersection(linuxs)}")
print(pythons|linuxs) # print(f"{pythons.union(linuxs)}")
print(pythons-linuxs) # print(f"{pythons.difference(linuxs)}")
print(pythons^linuxs) # print(f"{pythons.symmetric_difference(linuxs)}")
- 有如下列表,列表元素為不可hash類型,去重,得到新列表,且新列表一定要保持列表原來的順序
l=[
{'name':'egon','age':18,'sex':'male'},
{'name':'alex','age':73,'sex':'male'},
{'name':'egon','age':20,'sex':'female'},
{'name':'egon','age':18,'sex':'male'},
{'name':'egon','age':18,'sex':'male'},
]
```第一種答案:
ln = []
for i in l:
if i not in ln:
ln.append(i)
print(ln)
第二種答案:自己搜集
new_stu_info_list = []
for stu_info in stu_info_list:
if stu_info not in new_stu_info_list:
new_stu_info_list.append(stu_info)
for new_stu_info in new_stu_info_list:
print(new_stu_info)
**作業答案可參考:https://www.cnblogs.com/linhaifeng/articles/7133357.html#_label8`