zoukankan      html  css  js  c++  java
  • 第四天python作业

    day04作业

    1.写代码,有如下列表,按照要求实现每一个功能

    1. li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]

    2. 计算列表的长度并输出

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      print(len(li))
      
    3. 列表中追加元素"seven",并输出添加后的列表

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      print(li.append("seven"))
      
    4. 请在列表的第1个位置插入元素"Tony",并输出添加后的列表

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      print(li.insert(0, "Tony"))
      
    5. 请修改列表第2个位置的元素为"Kelly",并输出修改后的列表

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      li[1] = "Kelly"
      print(li)
      
    6. 请将列表l2=[1,"a",3,4,"heart"]的每一个元素添加到列表li中,一行代码实现,不允许循环添加。

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      l2=[1,"a",3,4,"heart"]
      li.extend(l2)
      print(li)
      
    7. 请将字符串s = "qwert"的每一个元素添加到列表li中,一行代码实现,不允许循环添加。

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      s = "qwert"
      li.extend(s)
      print(li)
      
    8. 请删除列表中的元素"ritian",并输出添加后的列表

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      li.remove("ritian")
      
    9. 请删除列表中的第2个元素,并输出删除的元素和删除元素后的列表

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      li.pop(1)
      print(li)
      
    10. 请删除列表中的第2至4个元素,并输出删除元素后的列表

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      del li[1:4]
      

    2.写代码,有如下列表,利用切片实现每一个功能

    1. li = [1, 3, 2, "a", 4, "b", 5,"c"]

    2. 通过对li列表的切片形成新的列表l1,l1 = [1,3,2]

      li = [1, 3, 2, "a", 4, "b", 5,"c"]
      l1 = li[:3]
      print(l1)
      
    3. 通过对li列表的切片形成新的列表l2,l2 = ["a",4,"b"]

      li = [1, 3, 2, "a", 4, "b", 5,"c"]
      l2 = li[3:6]
      print(l2)
      
    4. 通过对li列表的切片形成新的列表l3,l3 = ["1,2,4,5]

      li = [1, 3, 2, "a", 4, "b", 5,"c"]
      l3 = li[::2]
      
    5. 通过对li列表的切片形成新的列表l4,l4 = [3,"a","b"]

      li = [1, 3, 2, "a", 4, "b", 5,"c"]
      l4 = li[1:6:2]
      print(l4)
      
    6. 通过对li列表的切片形成新的列表l5,l5 = ["c"]

      li = [1, 3, 2, "a", 4, "b", 5,"c"]
      l5 = li[-1]
      
    7. 通过对li列表的切片形成新的列表l6,l6 = ["b","a",3]

      li = [1, 3, 2, "a", 4, "b", 5,"c"]
      l6 = li[-3::-1]
      print(l6)
      

    3.写代码,有如下列表,按照要求实现每一个功能。

    1. lis = [2, 3, "k", ["qwe", 20, ["k1", ["tt", 3, "1"]], 89], "ab", "adv"]

    2. 将列表lis中的"tt"变成大写(用两种方式)。

      lis = [2, 3, "k", ["qwe", 20, ["k1", ["tt", 3, "1"]], 89], "ab", "adv"]
      lis[3][2][1][0] = "TT"
      print(lis)
      
      lis = [2, 3, "k", ["qwe", 20, ["k1", ["tt", 3, "1"]], 89], "ab", "adv"]
      del = lis[3][2][1][0]
      lis[3][2][1].insert(0, "TT")
      print(lis)
      
    3. 将列表中的数字3变成字符串"100"(用两种方式)。

      lis = [2, 3, "k", ["qwe", 20, ["k1", ["tt", 3, "1"]], 89], "ab", "adv"]
      lis[1] = "100"
      lis[3][2][1][1] = "100"
      print(lis)
      
    4. 将列表中的字符串"1"变成数字101(用两种方式)。

      lis = [2, 3, "k", ["qwe", 20, ["k1", ["tt", 3, "1"]], 89], "ab", "adv"]
      lis[3][2][1][2] = 101
      print(lis)
      

    4.请用代码实现:

    li = ["alex", "wusir", "taibai"]

    1. 利用下划线将列表的每一个元素拼接成字符串"alex_wusir_taibai"

      li = ["alex", "wusir", "taibai"]
      print(("_").join(li))
      
      li = ["alex", "wusir", "taibai"]
      for i in li:
          s = s + i + "_"
      print(s.strip("_"))
      

    5.利用for循环和range打印出下面列表的索引。

    1. li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]

      li = ["alex", "WuSir", "ritian", "barry", "wenzhou"]
      count = 0
      for i in li:
          print(count)
       count += 1
          
      
      for i in range(len(li)):
          print(i)
      

    6.利用for循环和range找出100以内所有的偶数并将这些偶数插入到一个新列表中。

    lis = []
    for i in range(2, 100, 2):
        lis.append(i)
    print(lis)
    

    7.利用for循环和range 找出50以内能被3整除的数,并将这些数插入到一个新列表中。

    lis = []
    for i in range(0, 50, 3):
        lis.append(i)
    print(lis)
    

    8.利用for循环和range从100~1,倒序打印。

    for i in range(100, 0, -1):
        print(i)
    

    9.利用for循环和range从100~10,倒序将所有的偶数添加到一个新列表中,然后对列表的元素进行筛选,将能被4整除的数留下来。

    lis = []
    for i in range(100, 10):
        if i % 4 == 0
        	lis.append(i)
    print(lis)
    

    10.利用for循环和range,将1-30的数字一次添加到一个列表中,并循环这个列表,将能被3整除的数改成*。

    lis = []
    for i in range(1, 30):
        if i % 3 == 0:
            lis.append("*")
        else:
            lis.append(i)
    print(lis)
    

    11.查找列表li中的元素,移除每个元素的空格,并找出以"A"或者"a"开头,并以"c"结尾的所有元素,并添加到一个新列表中,最后循环打印这个新列表。

    li = ["TaiBai ", "alexC", "AbC ", "egon", " riTiAn", "WuSir", " aqc"]
    lis = []
    for i in li:
        if (i.startswith("a") or i.startswith("A")) and i.endswith("c"):
            lis.append("i")
    for ls in lis:
        print(ls)
            
    

    12.开发敏感词语过滤程序,提示用户输入评论内容,

    如果用户输入的内容中包含特殊的字符:
    敏感词列表 li = ["老师苍", "东京比较热", "武兰", "波多"]
    则将用户输入的内容中的敏感词汇替换成等长度的(老师苍就替换**),并添加到一个列表中;如果用户输入的内容没有敏感词汇,则直接添加到上述的列表中。

    li = ["老师苍", "东京比较热", "武兰", "波多"]
    msg = input("请输入")
    lst = []
    for i in li:
        if i in meg:
            msg = msg.replace(i, len(i)*"*")
    lst.append(msg)
    print(lst)
    

    13.有如下列表(选做题

    li = [1, 3, 4, "alex", [3, 7, 8, "TaiBai"], 5, "RiTiAn"]
    循环打印列表中的每个元素,遇到列表则再循环打印出它里面的元素。
    我想要的结果是:
    1
    3
    4
    alex
    3
    7
    8
    taibai
    5
    ritian

    li = [1, 3, 4, "alex", [3, 7, 8, "TaiBai"], 5, "RiTiAn"]
    for i in li:
        if type(i) == list:
            for ls in i:
                print(ls)
        else:
            print(i)
    
    li = [1, 3, 4, "alex", [3, 7, 8, "TaiBai"], 5, "RiTiAn"]
    for i in li:
        if type(i) == list:
            for em in i:
                if type(em) == str:
                    print(em.lower())
                else:
                    print(em)
        else:
            if type(i) == str:
                print(i.lower())
            else:
                print(i)
    
  • 相关阅读:
    x64 平台开发 Mapxtreme 编译错误
    hdu 4305 Lightning
    Ural 1627 Join(生成树计数)
    poj 2104 Kth Number(可持久化线段树)
    ural 1651 Shortest Subchain
    hdu 4351 Digital root
    hdu 3221 Bruteforce Algorithm
    poj 2892 Tunnel Warfare (Splay Tree instead of Segment Tree)
    hdu 4031 Attack(BIT)
    LightOJ 1277 Looking for a Subsequence
  • 原文地址:https://www.cnblogs.com/yuancw/p/11449487.html
Copyright © 2011-2022 走看看