zoukankan      html  css  js  c++  java
  • 集合及深浅copy 02

    集合

    求交集

    #求交集
    set1 = {1,2,3,4,5}
    set2 = {3,4,5,6,7}
    print(set1 & set2)
    print(set2.intersection(set1))
    View Code

    求并集

    #求并集
    set1 = {1,2,3,4,5}
    set2 = {3,4,5,6,7}
    print(set1 | set2)
    print(set2.union(set1))
    View Code

     反交集

    #求反交集
    set1 = {1,2,3,4,5}
    set2 = {3,4,5,6,7}
    print(set1 ^ set2)
    print(set2.symmetric_difference(set1))
    View Code

     差集

    #差集
    set1 = {1,2,3,4,5}
    set2 = {3,4,5,6,7}
    print(set1 - set2)
    print(set1.difference(set2))
    View Code

    子集与超集

    set1 = {1,2,3}
    set2 = {1,2,3,4,5,6,7}
    print(set1 < set2)
    print(set2.issubset(set1))
    View Code
    #超集
    set1 = {1,2,3}
    set2 = {1,2,3,4,5,6,7}
    print(set1 < set2)
    print(set2.issuperset(set1))
    View Code

    去重复

    set1 = [1,2,3,4,5,6,76,8,23,1,2,3,4,5]
    li = set(set1)
    print(li)
    set1 = list(li)
    print(set1)
    View Code

     把集合变为不可变集合

    s = frozenset("hksahdasl")
    print(s,type(s))
    View Code

     

     

     

  • 相关阅读:
    刷题238. Product of Array Except Self
    刷题236. Lowest Common Ancestor of a Binary Tree
    刷题208. Implement Trie (Prefix Tree)
    A1070
    A1048
    A1050
    A1041
    A1092
    A1084
    n进制转十进制
  • 原文地址:https://www.cnblogs.com/zly9527/p/11234902.html
Copyright © 2011-2022 走看看