本文是学习齐伟老师的《python全栈工程师》课程的笔记,欢迎学习交流。同时感谢齐老师的精彩传授!
习题01:
将字符串“python”转化为列表(记为lst),然后完成如下操作:
– 将字符串 ‘rust’ 中的每个字母作为独立元素追加到lst中
– 对 lst 排序
– 删除 lst 中的重复元素
s = 'python'
lst = list(s)
r = 'rust'
lst.extend(r)
lst.sort()
list(set(lst))
运行效果图:
习题02
- 编写程序,实现如下功能:
– 用户输入国家名称
– 打印出所输入国家名称及其首都
nations = {'China': 'Beijing', 'Japan': 'Tokyo', 'India': 'New Delhi', 'Sweden': 'Stockholm', 'Russian': 'Moscow', 'Germany': 'Berlin', 'UK': 'London', 'French': 'Paris', 'Swiss': 'Bern', 'Egypt':'Cairo', 'Australia': 'Canberra', 'New Zealand': 'Wellington', 'Canada': 'Ottawa', 'USA': 'Washington', 'Cuba': 'Havana', 'Brazil': 'Brasilia'}
name = input('input a name of country:')
capital = nations.get(name)
print('the country:', name)
print('the capital:', capital)
运行效果图:
习题03
- 有如下技术栈名称集合:skills = {‘Python’, ‘R’, ‘SQL’, ‘Git’, ‘Tableau’, ‘SAS’ }。假设自己的技术是:
myskills = {‘Python’, ‘R’},判断自己所掌握的技术是否在上述技术栈范围之内。
skills = {'Python', 'R', 'SQL', 'Git', 'Tableau', 'SAS' }
myskills = {'Python', 'Java'}
myskills.intersection(skills)
运行效果图:
习题04
- 找出以下两个字典共有的键:
{’a’: 1, ‘b’: 2, ‘c’: 3, ‘d’: 4}
{‘b’: 22, ‘d’: 44, ‘e’: 55, ‘f’: 77}
d1 = {’a': 1, 'b': 2, 'c': 3, 'd': 4}
d2 = {'b': 22, 'd': 44, 'e': 55, 'f': 77}
# 方法一:
d1_set = set(d1.keys())
d2_set = set(d2.keys())
common_key = d1_set.intersection(d2_set)
# 方法二:适用于python3.6+的版本
d1.keys() & d2.keys()
运行效果图:
习题05
- 字符串:songs = ‘You raise my up so I can stand on mountains You raise my up to walk on stormy seas I am strong when I am on our shoulders You raise me up to mroe than I can be’
制作上述字符串的单词表,统计每个单词的出现次数
小编参考:
songs = 'You raise my up so I can stand on mountains You raise my up to walk on stormy seas I am strong when I am on our shoulders You raise me up to mroe than I can be'
lst = songs.split(' ')
new_lst = {}
for i in range(len(lst)):
if lst[i] in new_lst:
new_lst[lst[i]] += 1
else:
new_lst[lst[i]] = 1
print(new_lst)
运行效果图: