更改清华镜像源:下面这个是debug的包
pip install -i https://pypi.tuna.tsinghua.edu.cn/simple ipdb
pip install jieba -i https://pypi.douban.com/simple
可以永久更改镜像源:
dict1 = {'A': 1, 'B': 1, 'C': 1, 'D': 1, 'e': 1}
for k,v in dict1.items():
print(k,v)
# 把a合并到b中
a = {'a':1,'b':2}
b = {'c':3,'d':4}
# for item,item1 in zip(a.keys(),a.values()):
# b[item] = item1
# b
for [item,item1] in a.items():
b[item] = item1
b
关于reverse,reverse不能赋值,只能在原数据上改动:
# reverse函数不能直接赋值,这是直接引用,不然返回的值是none
a = [1,2,33,4]
a1 = a[1:3]
a.reverse()
a
注意,我们在使用reverse()函数的时候,不光需要保证原数据是列表的形式,并且还要确定修改的时候是在原数据的基础上面直接reverse(),而不需要再重新赋值,也就是 arr = arr.reverse(),这样是直接修改了原数据变成了一个新的内容,也就是在内存当中开辟了一个新的存储空间。这样做的话会使返回结果变为None。
更改部分列表中部分数据的位置:
def change_place(list1,start,end):
a1 = list1[start:end]
a1.reverse()
new = a[0:start]+a1+a[end::]
return new
a = [10, 20, 30, 40, 50, 60, 70, 80]
change_place(a,2,6)
# 某两个指定的数更改位置,比如要把50和40的位置交换,需要利用下标来做
def change_place(list1,start,end):
list1[start],list1[end] = list1[end],list1[start]
return list1
a = [10, 20, 50, 40, 30, 60, 70, 80]
change_place(a,1,2)
a
a = [10, 20, 50, 40, 30, 60, 70, 80]
# 列表修改,可以直接,也可以直接这样互换
a[1],a[3]=10,11
a
def reverse_list_in_location(lst, start_pos, end_pos):
while start_pos < end_pos:
lst[start_pos], lst[end_pos] = lst[end_pos], lst[start_pos]
start_pos += 1
end_pos -= 1
return lst
nums = [10,20,30,40,50,60,70,80]
start_pos = 2
end_pos = 4
print("Original list:")
print(nums)
print("Reverse elements of the said list between index position "+str(start_pos)+ " and "+str(end_pos))
print(reverse_list_in_location(nums,start_pos,end_pos))
start_pos = 6
end_pos = 7
print("\nOriginal list:")
print(nums)
print("Reverse elements of the said list between index position "+str(start_pos)+ " and "+str(end_pos))
print(reverse_list_in_location(nums,start_pos,end_pos))
start_pos = 0
end_pos = 7
print("\nOriginal list:")
print(nums)
print("Reverse elements of the said list between index position "+str(start_pos)+ " and "+str(end_pos))
print(reverse_list_in_location(nums,start_pos,end_pos))
关于深拷贝浅拷贝,深拷贝是开辟新的存储空间了,和原来的无关了,浅拷贝只是引用;