作业-day6-实现部分函数

1.实现count:

list1 = [1, 2, 1, 1, 2, 3, 3, 3, 4, 5, 6, 6, 7]
element1 = 6count1 = 0for element2 in list1[:]:    
    if element1 == element2:        
        count1 += 1
print(count1)       # 2

# 方法2:
list1 = [1, 2, 1, 1, 2, 3, 3, 3, 4, 5, 6, 6, 7]
element1 = input("请输入:")
count1 = 0
for element2 in list1[:]:
    if str(element2) == element1:
        count1 += 1
print(count1)       

请输入:4
1
Process finished with exit code 0

2.实现index:

# 方法1:
element = "貂蝉"
names = ['1曹操', "2刘备", "3赵云", "4小乔", "5貂蝉", "6吕布", "7赵云", "8asd"]
for i in range(len(names)):
    if element == names[i]:
        print(i)
        break
else:
    print("Error,元素不存在")    # 2
    
# 方法2:
names = [3, "2刘备", "3赵云", 23, "5貂蝉", (1, 5, 3), "7赵云", "8asd"]
element1 = input("请输入:")
for i in range(len(names)):
    if str(names[i]) == element1:
        print(i)
        break
else:
    print("Error")      
    
请输入:(1, 5, 3)
5
Process finished with exit code 0

3.实现extend:

names = ['曹操', "刘备", "赵云", "小乔", "貂蝉", "吕布", "赵云"]
element1 = '后裔'
if type(element1) == int:
    names.append(element1)
else:
    for element2 in element1[:]:
        names.append(element2)
print(names)        # ['曹操', '刘备', '赵云', '小乔', '貂蝉', '吕布', '赵云', '后', '裔']

4.实现reverse:

names = ['1曹操', "2刘备", "3赵云", "4小乔", "5貂蝉", "6吕布", "7赵云", "8asd"]

# 方法1:
names2 = []
for name in names[-1::-1]:
    names2.append(name)
for i in range(len(names)):
    names[i] = names2[i]
print(names)        # ['8asd', '7赵云', '6吕布', '5貂蝉', '4小乔', '3赵云', '2刘备', '1曹操']

# 方法2:
n = len(names)
for i in range(n):
    for j in range(n):
        if i > j:
            names[i], names[j] = names[j], names[i]
print(names)        # ['8asd', '7赵云', '6吕布', '5貂蝉', '4小乔', '3赵云', '2刘备', '1曹操']

# 方法3:
n = len(names)
for i in range(n // 2):
    k = n - 1 - n
    names[i], names[k] = names[k], names[i]
print(names)    # # ['8asd', '7赵云', '6吕布', '5貂蝉', '4小乔', '3赵云', '2刘备', '1曹操']
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
【社区内容提示】社区部分内容疑似由AI辅助生成,浏览时请结合常识与多方信息审慎甄别。
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

友情链接更多精彩内容