老王python之基本数据结构习题
**习题1:
列表a = [11,22,24,29,30,32]
1 把28插入到列表的末端
2 在元素29后面插入元素57
3 把元素11修改成6
3 删除元素32
4 对列表从小到大排序**
>>> a = [11,22,24,29,30,32]
>>> a.append(28)
>>> a
[11, 22, 24, 29, 30, 32, 28]
>>> a.insert(4,57)
>>> a
[11, 22, 24, 29, 57, 30, 32, 28]
>>> a[0] = 6
>>> a
[6, 22, 24, 29, 57, 30, 32, 28]
>>> a.pop(-2)
32
>>> a
[6, 22, 24, 29, 57, 30, 28]
>>> a.sort()
>>> a
[6, 22, 24, 28, 29, 30, 57]
**习题2:
列表b = [1,2,3,4,5]
1 用2种方法输出下面的结果:
[1,2,3,4,5,7,8]
2 用列表的2种方法返回结果:[5,4]
3 判断2是否在列表里**
1、
>>> b = [1,2,3,4,5]
>>> b.append(7)
>>> b.append(8)
>>> b
[1, 2, 3, 4, 5, 7, 8]
>>> b = [1,2,3,4,5]