zoukankan      html  css  js  c++  java
  • Python11月24日周考答案

    # 第一题
    # int bool float str list tuple dict set
    # str
    # split()
    # upper()
    # lower()
    # swapcase()
    # count()
    # find()
    # index()
    # ''.join()
    # max()
    # min()
    # replace()
    # re
    #
    # list
    #
    # pop()
    # append()
    # len()
    # Max()
    # Min()
    # Sort()
    # Sorted()
    # Insert()
    # Index()
    # Remove()
    # Clear()
    # Extend()
    # Count()
    # Dict
    # Keys()
    # Values()
    # Fromkeys()
    # Update()
    # Items()
    # Del
    # Pop()
    #
    # Set
    # Add
    # Pop
    # remove
    # #第二题
    # lists = [1,4,4,5,5,6]
    # print(list(set(lists)))
    #
    # l = []
    # for i in lists:
    # if i not in l:
    # l.append(i)
    # print(l)
    #
    # dicts = {}
    # lists = list(dicts.fromkeys(lists).keys())
    # print(lists)
    #
    # import numpy as np
    # n = np.unique(lists)
    # print(list(n))
    #
    # import itertools
    # demo = itertools.groupby(lists)
    # lists = []
    # for a,b in demo:
    # lists.append(a)
    # print(lists)

    # 第三题
    # def maxs(*args):
    # min=args[0]
    # max=args[0]
    # for i in args:
    # if min>i:
    # min=i
    # if max<i:
    # max=i
    # return min,max
    #
    # a = maxs(1,18,3,4,5)
    # print(a)

    # 第四题
    # a = [1,2,4,7,9]
    # b = [2,4,9,10,21]
    # def index(a,b):
    # list1 = []
    # list2 = []
    # for i in a:
    # if i in b:
    # list1.append(i)
    # else:
    # list2.append(i)
    # for i in b:
    # if i not in a:
    # list2.append(i)
    #
    # return list1,list2
    #
    # print(index(a,b))

    # 先转成集合
    # a = t | s # t 和 s的并集
    #
    # b = t & s # t 和 s的交集
    #
    # c = t – s # 求差集(项在t中,但不在s中)
    #
    # d = t ^ s # 对称差集(项在t或s中,但不会同时出现在二者中)
    #第五题
    # lists = [[1,2],[3,4],[5,6]]
    # s = [j for x in lists for j in x]

    # ss = [int(x) for x in str(lists).replace('[','').replace(']','').split(',')]
    # print(ss)

    # sss = sum(lists,[])
    # print(sss)

    #第六题
    # a = ['aww','222',222,45645]
    # import random
    # random.shuffle(a)
    # print(a)

    # 第七题
    # dict1 = {}
    # dicts = {"A":1,"B":2}
    # for a,b in dicts.items():
    # dict1[b] = a
    # print(dict1)

    # dicts.values()
    # for i in dicts.keys():
    # dict1[dicts[i]] = i
    # print(dict1)

    # print({v:k for k,v in dicts.items()})
    #第八题
    # a = 123
    # b = 567

    # c = a
    # a = b
    # b = c
    # print(a,b)


    # a,b = b,a
    # print(a,b)
    # 第九题
    # enumerate() 函数用于将一个可遍历的数据对象(如列表、元组或字符串)组合为一个索引序列,同时列出数据和数据下标,一般用在 for 循环当中。

    # 第十题
    # def index(lists):
    # for j in range(len(lists)-1):
    # for i in range(len(lists)-1-j):
    # if lists[i]>lists[i+1]:
    # lists[i],lists[i+1] = lists[i+1],lists[i]
    # return lists
    # lists = [1, 14, 33, 4, 67, 12, 465, 5, 8]
    # print(index(lists))
    #第十题
    # strs='++++----++--'
    # s = strs.count('+')*'+'+strs.count('-')*'-'
    # print(s)

    # strs = '++++----++--'
    # s_list = list(strs)
    # n = 0
    # for i in range(len(s_list)):
    # if s_list[n] == '+':
    # p = s_list.pop(n)
    # s_list.append(p)
    # else:
    # n = n + 1
    # print(s_list)


    # def jj(a):
    # left = []
    # right = []
    # for i in a:
    # if i == "+":
    # left.append(i)
    # else:
    # right.append(i)
    # left.extend(right)
    # return left
    # print(jj(["+","-","+","-","+","-"]))
    # www.baidu.com中的地址(2)a="张明 98 分",用 re.sub,将 98 替换为 100
    # import re
    # a = 'www.baidu.com'
    # b = "张明 98 分"
    # demo = re.compile('www.(w+).com')
    # lists = demo.findall(a)
    # print(lists)
    # last = re.sub('d{2}','100',b)
    # print(last)

    #十四题
    # a = 'asdfasfsad'
    # b = 'sfsdfsdsd'
    # demo = ''.join(sorted(list(a+b)))
    # print(demo)
  • 相关阅读:
    简单背包问题
    拓扑排序
    SPFA--P3905 道路重建
    Floyd--P1119 灾后重建
    Kmp--P3375 【模板】KMP字符串匹配
    练习 后缀数组
    BZOJ1036: [ZJOI2008]树的统计Count(树链剖分)
    BZOJ1503: [NOI2004]郁闷的出纳员(Splay)
    BZOJ2733: [HNOI2012]永无乡(线段树合并)
    BZOJ4196: [Noi2015]软件包管理器(树链剖分)
  • 原文地址:https://www.cnblogs.com/tangmf/p/14052437.html
Copyright © 2011-2022 走看看