1.
b.不可以
c.
tu=("alex",[11,22,{"k1":"v1","k2":["age","name"],"k3":(11,22,33)},44])
tu[1][2]["k2"].append("Seven")
print(tu)
d.
tu[1][2]["k3"] 不可以
2.
dic={"k1":"v1","k2":"v2","k3":[11,22,33]}
a.请循环输出所有的key
for a in dic.keys():
print(a)
b.请循环输出所有的key
for a in dic.values():
print(a)
c.请循环输出所有的key和values
for a in dic.items():
print(a)
d.
dic["k4"]="v4"
print(dic)
e.
dic["k1"]="alex"
print(dic)
f.
dic={"k1":"v1","k2":"v2","k3":{1:[11,22,33]}}
dic["k3"].append(44)
print(dic)
g.
dic["k3"].insert(1,'')
print(dic)
dic.pop('k1')
print(dic)
4.
a='k1:1|k1:2|k2:3|k4:4'
dic={}
lst=a.split('|')
print(lst)
for i in lst:
print(i)
k,v=i.split(":")
dic[k]=int(v)
print(dic)
5. li=[11,56,59,52,98,98,65,69,11,32] 
dic={}
list=[]
list2=[] for a in li :
  if a > 66:
  list.append(a)
  else :
  list2.append(a)
  print(list)
dic.setdefault("k1",list)
dic.setdefault("k2", list2)
print(dic) 6. lst=[1,2,9,3,"name","电脑"]
goods=[{"name":"电脑","price":""},{"name":"鼠标","price":""},{"name":"键盘","price":""}] while 1:
  xh = input("")   if xh.lower()=='q':   break   elif int(xh) >len(goods) or int(xh) <=0:   print("输入有误")   else:   print(xh+goods[int(xh)-1]["name"]+" "+goods[int(xh)-1]["price"])

python day05 作业答案的更多相关文章

  1. python day10作业答案

    2.def func(*args): sum = 0 for i in args: sum=sum+int(i) return sum a=func(2,3,9,6,8) print(a) 3. a= ...

  2. python day09作业答案

    2. def lst(input): lst2=[] count=0 for i in range(0,len(input)): if i %2!=0: lst2.append(input[i]) r ...

  3. python day08作业答案

    1. a f=open('11.txt','r',encoding='utf-8') a=f.read() print(a) f.flush() f.close() b. f=open('11.txt ...

  4. python day07作业答案

    1. sum=0 a=input() for i in a: sum=sum+int(i)**3 if sum==int(a): print('水仙数') 2. lst=[100,2,6,9,1,10 ...

  5. python day06 作业答案

    1. count=1 while count<11: fen=input('请第{}个评委打分' .format( count)) if int(fen) >5 and int(fen) ...

  6. python day05作业

  7. python day04 作业答案

    1. 1) li=['alex','WuSir','ritian','barry','wenzhou'] print(len(li)) 2) li=['alex','WuSir','ritian',' ...

  8. python day02 作业答案

    1. (1).false   (2).false 2. (1).8  (2).4 3. (1).6  (2).3  (3).false (4).3   (5).true   (6).true  (7) ...

  9. My way to Python - Day05 - 面向对象-思维导图

    My way to Python - Day05 - 面向对象   思维导图

随机推荐

  1. 卸载WPS后怎么WORD的图标还是WPS

    在电脑中选择使用Microsoft Office并将之前安装的WPS Office办公软件卸载了.但是卸载之后发现电脑系统中的Word.Excel等文件无法正常显示图标.在这样的情况下,我们应该如何解 ...

  2. iptables -F 与 -X 区别

    test: 1.iptables 初始化 2.iptables -X (第一次) 错误原因是自定义链表(test)不为空 3.iptables -F 4.iptables -X ok,实验结束 实验报 ...

  3. Matlab-8:松弛迭代法(SOR)

    function [x,n,flag]=sor(A,b,eps,M,max1) %sor函数为用松弛迭代法求解线性方程组 %A为线性方程组的系数矩阵 %b为线性方程组的常数向量 %eps为精度要求 % ...

  4. tornado 异步

    引言 注:正文中引用的 Tornado 代码除特别说明外,都默认引用自 Tornado 4.0.1. tornado.gen 模块是一个基于 python generator 实现的异步编程接口.通过 ...

  5. leetcode-algorithms-14 Longest Common Prefix

    leetcode-algorithms-14 Longest Common Prefix Write a function to find the longest common prefix stri ...

  6. 使用navigator.userAgent.toLowerCase()判断移动端类型

    使用navigator.userAgent.toLowerCase()判断移动端类型 判断设备,区分Android,iphone,ipad和其它 var ua = navigator.userAgen ...

  7. lucene 根据 id 获取索引内容(C# / .NET)

    封装代码如下: public MakerArtiImodel GetIndexModelById(int id) { string indexPath = StrHelper.rootPath + & ...

  8. InnoDB存储引擎介绍-(4)Checkpoint机制一

    检查点的工作机制: innodb会自动维护一个检查点的机制,叫做 fuzzy checkpointing(当然sharp checkpoint也是检查点之一),fuzzy checkpointing就 ...

  9. Sorting Algorithms

    Merge sort by using recursive strategy, i.e. divide and conquer. def merge(left,right): result = [] ...

  10. Hadoop--单点故障修复

    nameNode单点故障修复 1.启动虚拟机,启动集群  此时我们将主机hadoop1关机(断掉主机),开始抢救: 1.使用 秘书(secondaryNameNode),成功率不是100%  (这里我 ...