From 5f849f159bc7fc1912a5559574583b8dc8e9678c Mon Sep 17 00:00:00 2001
From: sheldoer <2535668999@qq.com>
Date: Fri, 14 May 2021 17:00:01 +0800
Subject: [PATCH] =?UTF-8?q?=E4=B9=8B=E5=89=8D=E4=B9=A0=E9=A2=98=E8=A1=A5?=
 =?UTF-8?q?=E5=85=85?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...11\346\225\260\344\271\213\345\222\214.py" | 16 ++++++++++
 1002.py                                       | 17 ++++++++++
 1078.py                                       | 13 ++++++++
 118.py                                        | 15 +++++++++
 1337.py                                       | 16 ++++++++++
 1491.py                                       |  6 ++++
 171.py                                        |  9 ++++++
 215.py                                        |  8 +++++
 283.py                                        | 10 ++++++
 476.py                                        | 10 ++++++
 485.py                                        | 16 ++++++++++
 561.py                                        | 12 +++++++
 575.py                                        |  5 +++
 657.py                                        |  9 ++++++
 748.py                                        | 17 ++++++++++
 811.py                                        | 24 ++++++++++++++
 821.py                                        | 20 ++++++++++++
 832.py                                        | 13 ++++++++
 883.py                                        |  2 ++
 905.py                                        |  5 +++
 908.py                                        | 19 ++++++++++++
 922.py                                        | 11 +++++++
 929.py                                        | 17 ++++++++++
 953.py                                        | 31 +++++++++++++++++++
 inte0101.py                                   |  8 +++++
 25 files changed, 329 insertions(+)
 create mode 100644 "015\344\270\211\346\225\260\344\271\213\345\222\214.py"
 create mode 100644 1002.py
 create mode 100644 1078.py
 create mode 100644 118.py
 create mode 100644 1337.py
 create mode 100644 1491.py
 create mode 100644 171.py
 create mode 100644 215.py
 create mode 100644 283.py
 create mode 100644 476.py
 create mode 100644 485.py
 create mode 100644 561.py
 create mode 100644 575.py
 create mode 100644 657.py
 create mode 100644 748.py
 create mode 100644 811.py
 create mode 100644 821.py
 create mode 100644 832.py
 create mode 100644 883.py
 create mode 100644 905.py
 create mode 100644 908.py
 create mode 100644 922.py
 create mode 100644 929.py
 create mode 100644 953.py
 create mode 100644 inte0101.py

diff --git "a/015\344\270\211\346\225\260\344\271\213\345\222\214.py" "b/015\344\270\211\346\225\260\344\271\213\345\222\214.py"
new file mode 100644
index 0000000..f72af3f
--- /dev/null
+++ "b/015\344\270\211\346\225\260\344\271\213\345\222\214.py"
@@ -0,0 +1,16 @@
+class Solution:
+    def threeSum(self, nums):
+        length=len(nums)
+        ls=[]
+        same=[]
+        for i in range(length):
+            for j in range(i+1,length):
+                if 0-nums[i]-nums[j] in nums[j+1:]:
+                    lst=[nums[i],nums[j],0-nums[i]-nums[j]]
+                    if set(lst)not in same:
+                        ls.append(lst)
+                        same.append(set(lst))
+        print(ls)
+        
+p1=Solution()
+print(p1.threeSum([-1,0,1,2,-1,-4]))
diff --git a/1002.py b/1002.py
new file mode 100644
index 0000000..6623d76
--- /dev/null
+++ b/1002.py
@@ -0,0 +1,17 @@
+def find_use(A):
+    res=[]
+    for i in A[0]:
+        flag=1
+        for j in A:
+            if i not in j:
+                flag=0
+                break
+        if flag==1:
+            res.append(i)
+        
+                
+    return res
+
+if __name__=="__main__":
+    A=["bella","label","roller"]
+    print(find_use(A))
diff --git a/1078.py b/1078.py
new file mode 100644
index 0000000..cad6810
--- /dev/null
+++ b/1078.py
@@ -0,0 +1,13 @@
+import re
+def find_third(s,first,second):
+    #查找指定字符后的单词
+    dest=re.findall(f'{first}\s{second}\s\w+',s)
+    print(dest)
+    res=[]
+    for i in dest:
+        res.append(i.split()[-1])
+    print(res)
+s = "we will we will rock you"
+first = "we"
+second = "will"
+find_third(s,first,second)
diff --git a/118.py b/118.py
new file mode 100644
index 0000000..54b878d
--- /dev/null
+++ b/118.py
@@ -0,0 +1,15 @@
+def gene_tri(num):
+    if num==1:
+        return [[1]]
+    if num==2:
+        return [[1],[1,1]]
+    res=[[1],[1,1]]
+    for i in range(2,num):
+        nrow=[1]
+        for j in range(i-1):
+            nrow.append(res[i-1][j]+res[i-1][j+1])
+        nrow.append(1)
+        res.append(nrow)
+    return res
+if __name__=='__main__':
+    print(gene_tri(5))
diff --git a/1337.py b/1337.py
new file mode 100644
index 0000000..fa94cfa
--- /dev/null
+++ b/1337.py
@@ -0,0 +1,16 @@
+def sort_army(mat,k):
+    res=[]
+    for i in range(len(mat)):
+        res.append((mat[i].count(1),i))
+    res.sort(key=lambda x:x[0])
+    row=[res[i][1] for i in range(k)]
+    return row
+mat=[[1,1,0,0,0],
+     [1,1,1,1,0],
+     [1,0,0,0,0],
+     [1,1,0,0,0],
+     [1,1,1,1,1]]
+print(sort_army(mat,3))
+        
+mat = [[1,0,0,0], [1,1,1,1], [1,0,0,0], [1,0,0,0]]
+print(sort_army(mat,2))
diff --git a/1491.py b/1491.py
new file mode 100644
index 0000000..1305910
--- /dev/null
+++ b/1491.py
@@ -0,0 +1,6 @@
+class Solution:
+    def average(self, salary) -> float:
+        salary.sort()
+        return sum(salary[1:-1])/(len(salary)-2)
+pl=Solution()
+print(pl.average([4000,3000,1000,2000]))
diff --git a/171.py b/171.py
new file mode 100644
index 0000000..672cc14
--- /dev/null
+++ b/171.py
@@ -0,0 +1,9 @@
+def _171(s):
+    nums=0
+    for i in range(1,len(s)+1):
+        num=ord(s[-i])-ord('A')+1
+        nums+=num*(26**(i-1))
+    return nums
+if __name__=='__main__':
+    s="A"
+    print(_171(s))
diff --git a/215.py b/215.py
new file mode 100644
index 0000000..236b5f2
--- /dev/null
+++ b/215.py
@@ -0,0 +1,8 @@
+class Solution:
+    #在未排序的数组中找到第 k 个最大的元素。
+    #请注意，你需要找的是数组排序后的第 k 个最大的元素，而不是第 k 个不同的元素。
+    def findKthLargest(self, nums, k: int) -> int:
+        nums.sort()
+        return nums[-k]
+pl=Solution()
+print(pl.findKthLargest([3,2,3,1,2,4,5,5,6],4))
diff --git a/283.py b/283.py
new file mode 100644
index 0000000..4d4bbba
--- /dev/null
+++ b/283.py
@@ -0,0 +1,10 @@
+def move_list(nums:list):
+    #调整数组顺序
+    zero=nums.count(0)    #统计0的个数
+    for i in range(zero): #先删去数组中的0
+        nums.remove(0)
+    nums.sort()
+    for i in range(zero): #再在末尾添加相同个数的0
+        nums.append(0)
+    return nums
+print(move_list([0,1,0,3,12]))
diff --git a/476.py b/476.py
new file mode 100644
index 0000000..650476f
--- /dev/null
+++ b/476.py
@@ -0,0 +1,10 @@
+def _476(n):
+    num='0b'
+    for i in bin(n)[2:]:
+        if i=='0':
+            num=num+'1'
+        else:
+            num=num+'0'
+    return int(num,2)
+if __name__=='__main__':
+    print(_476(1))
diff --git a/485.py b/485.py
new file mode 100644
index 0000000..eedcab4
--- /dev/null
+++ b/485.py
@@ -0,0 +1,16 @@
+def count_1(lst):
+    mcnt=0
+    length=len(lst)
+    for i in range(length):
+        if lst[i]==1:
+            cnt=1
+            for j in range(i+1,length):
+                if lst[j]!=1:
+                    break
+                cnt+=1
+            if cnt>mcnt:
+                mcnt=cnt
+    return mcnt
+if __name__=='__main__':
+    print(count_1([1,1,0,1,1,1]))
+            
diff --git a/561.py b/561.py
new file mode 100644
index 0000000..3a3e0e9
--- /dev/null
+++ b/561.py
@@ -0,0 +1,12 @@
+def _561(lst):
+    lst.sort()
+    res=[]
+    for i in range(len(lst)//2):
+        tem=[lst[2*i],lst[2*i+1]]
+        res.append(tem)
+    num=0
+    for i in res:
+        num+=min(i)
+    return num
+if __name__=='__main__':
+    print(_561( [1,4,3,2]))
diff --git a/575.py b/575.py
new file mode 100644
index 0000000..4ee59a3
--- /dev/null
+++ b/575.py
@@ -0,0 +1,5 @@
+def kandy_split(lst):
+    return min(len(set(lst)),int(len(lst)/2))
+if __name__=='__main__':
+    lst=[1,1,2,3]
+    print(kandy_split(lst))
diff --git a/657.py b/657.py
new file mode 100644
index 0000000..2a159fe
--- /dev/null
+++ b/657.py
@@ -0,0 +1,9 @@
+def _657(s):
+    if s.count('U')==s.count('D') and s.count('R')==s.count('L'):
+        return True
+    else:
+        return False
+if __name__=='__main__':
+    s='UD'
+    s='LL'
+    print(_657(s))
diff --git a/748.py b/748.py
new file mode 100644
index 0000000..1c22833
--- /dev/null
+++ b/748.py
@@ -0,0 +1,17 @@
+def _748(lst,words):
+    import re
+    word=re.findall('[a-z]',lst.lower())
+    words.sort(key=lambda x:len(x))
+    for i in words:
+        flag=1
+        li=i.lower()
+        for j in set(word):
+            if li.count(j)<word.count(j):
+                flag=0
+                break
+        if flag==1:
+            return i
+    return None
+if __name__=='__main__':
+    print(_748("1s3 PSt", ["step", "steps", "stripe", "stepple"]))
+            
diff --git a/811.py b/811.py
new file mode 100644
index 0000000..a5157e1
--- /dev/null
+++ b/811.py
@@ -0,0 +1,24 @@
+def count_nums(lst):
+    if not lst:
+        return []
+    dic={}
+    for case in lst:
+         time,domain=case.split()
+         length=len(domain.split('.'))
+         for num in range(length):
+             dm=domain.split('.',num)[-1]
+             print(dm)
+             dic[dm]=dic.get(dm,0)+int(time)
+    return [str(v)+' '+k for k,v in dic.items()]
+'''
+         domain=num[1].split('.')
+         print(domain)
+         for j in domain:
+             dic[j]=dic.get(j,0)+int(num[0])
+    return [str(v)+' '+k for k,v in dic.items()]
+    '''
+if __name__=='__main__':
+    lst=["900 google.mail.com"]
+    print(count_nums(lst))      
+    
+                   
diff --git a/821.py b/821.py
new file mode 100644
index 0000000..6d4996f
--- /dev/null
+++ b/821.py
@@ -0,0 +1,20 @@
+def search_distance(s,c):
+    allc=[]
+    '''
+    d=s.index(c)  
+    while True:
+        allc.append(d)
+        d=s.index(c,d)'''
+    for i in range(len(s)):
+        if s[i]==c:
+            allc.append(i)
+    print(allc)
+    res=[]
+    for i in range(len(s)):
+        md=min(abs(j-i) for j in allc)
+        res.append(md)
+    return res
+if __name__=='__main__':
+     s = 'loveleetcode'
+     c = 'e'
+     print(search_distance(s,c))
diff --git a/832.py b/832.py
new file mode 100644
index 0000000..625a597
--- /dev/null
+++ b/832.py
@@ -0,0 +1,13 @@
+def _832(lst):
+    length=len(lst)
+    for i in range(length):
+        lst[i].reverse()
+        for j in range(len(lst[0])):
+            if lst[i][j]==0:
+                lst[i][j]=1
+            else:
+                lst[i][j]=0
+    return lst
+if __name__=='__main__':
+    lst= [[1,1,0,0],[1,0,0,1],[0,1,1,1],[1,0,1,0]]
+    print(_832(lst))
diff --git a/883.py b/883.py
new file mode 100644
index 0000000..4ba0f11
--- /dev/null
+++ b/883.py
@@ -0,0 +1,2 @@
+def three_area(xyz):
+    pass
diff --git a/905.py b/905.py
new file mode 100644
index 0000000..dcb3062
--- /dev/null
+++ b/905.py
@@ -0,0 +1,5 @@
+def _905(lst):
+    onum=[x for x in lst if x%2==0]
+    enum=[y for y in lst if y%2!=0]
+    return onum+enum
+print(_905([3,1,2,4]))
diff --git a/908.py b/908.py
new file mode 100644
index 0000000..1ac20d0
--- /dev/null
+++ b/908.py
@@ -0,0 +1,19 @@
+def _908(lst,k):
+    return max(max(lst) - min(lst) - 2*k, 0)
+    lst=list(set(lst))
+    if len(lst)<2:
+        return 0
+    mxa=max(lst)
+    mna=min(lst)
+    if mxa-mna<=2*k:
+        return 0
+    lst.remove(mxa)
+    lst.remove(mna)
+    lst.append(mxa-abs(k))
+    lst.append(mna+abs(k))
+    return max(lst)-min(lst)
+if __name__=='__main__':
+    A = [1]
+    K = 0
+    print(_908(A,K))
+    
diff --git a/922.py b/922.py
new file mode 100644
index 0000000..ef1d9e5
--- /dev/null
+++ b/922.py
@@ -0,0 +1,11 @@
+def _922(lst):
+    snum=[x for x in lst if x%2!=0]
+    onum=[y for y in lst if y%2==0]
+    num=[]
+    for i in range(len(lst)//2):
+        num.append(onum[i])
+        num.append(snum[i])
+    return num
+if __name__=='__main__':
+    print(_922([4,2,5,7]))
+    
diff --git a/929.py b/929.py
new file mode 100644
index 0000000..236b22f
--- /dev/null
+++ b/929.py
@@ -0,0 +1,17 @@
+def to_email(lst):
+    res=set()
+    for i in lst:
+        mail=i.split('@')   #根据@符号分割，第一项为本地名称，第二项为域名
+        s=''
+        for j in mail[0]:   #对本地名称进行.与+的符号操作
+            if j=='.':
+                continue
+            elif j=='+':
+                break
+            else:
+                s=s+j
+        res.add(s+mail[1])  #对集合添加目标邮件地址
+    return len(res)
+if __name__=='__main__':
+    lst=["test.email+alex@leetcode.com","test.e.mail+bob.cathy@leetcode.com","tes temail+david@lee.tcode.com"]
+    print(to_email(lst))
diff --git a/953.py b/953.py
new file mode 100644
index 0000000..365f862
--- /dev/null
+++ b/953.py
@@ -0,0 +1,31 @@
+def order_sequence(words:list,order:str):
+    '''length=min(len(i) for i in words)    #找到最小长度
+    for i in range(length):
+        words[0][i]>words[1][i]'''
+    length=len(words)
+    for i in range(length):
+        A=words[i]
+        for j in range(i+1,length):
+            B=words[j]
+            n=0
+            mlen=min(len(A),len(B))
+            while n<mlen and words[i][n]==words[j][n]:
+                    n+=1
+            if n==mlen==len(B):
+                return False
+            else:
+                continue
+            if order.index(A[n])<order.index(B[n]):
+                continue
+            else:
+                return False
+
+    return True
+    
+def main():
+    words = ["ap","app",'joim']
+    order = "abcdefghijklmnopqrstuvwxyz"
+    print(order_sequence(words,order))
+if __name__=='__main__':
+    main()
+    
diff --git a/inte0101.py b/inte0101.py
new file mode 100644
index 0000000..95aa7b6
--- /dev/null
+++ b/inte0101.py
@@ -0,0 +1,8 @@
+def inte0101(s):
+    if len(s)==len(set(s)):
+        return True
+    else:
+        return False
+if __name__=='__main__':
+    s="leetcode"
+    print(inte0101(s))