add 26 784 KMP

Author: xulzee

118.pascals-triangle.py

@@ -1,3 +1,11 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 118.pascals-triangle.py
+# @Software: PyCharm
+
+
 class Solution:
     def generate(self, numRows):
         """

122. Best Time to Buy and Sell Stock II.py

@@ -0,0 +1,6 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/26 14:56
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 122. Best Time to Buy and Sell Stock II.py
+# @Software: PyCharm

26. Remove Duplicates from Sorted Array.py

@@ -0,0 +1,40 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/26 11:47
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 26. Remove Duplicates from Sorted Array.py
+# @Software: PyCharm
+from typing import List
+
+
+class Solution:
+    # pop
+    def removeDuplicates1(self, nums: List[int]) -> int:
+        j = 0
+        remove_list = []
+        for i in range(1, len(nums)):
+            if nums[i] == nums[j]:
+                remove_list.append(i)
+            j = i
+        # print(remove_list)
+        for i in remove_list[::-1]:
+            nums.pop(i)
+        return len(nums)
+
+    # swap
+    def removeDuplicates(self, nums: List[int]) -> int:
+        j = 1
+        if len(nums) > 0:
+            for i in range(1, len(nums)):
+                if nums[i] != nums[i - 1]:
+                    nums[j] = nums[i]
+                    j += 1
+        else:
+            j = 0
+        return j
+
+
+if __name__ == '__main__':
+    A = [0, 0, 1, 1, 1, 2, 2, 3, 3, 4]
+    print(Solution().removeDuplicates(A))
+    print(A)

371.sum-of-two-integers.py

@@ -1,3 +1,10 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 371.sum-of-two-integers.py
+# @Software: PyCharm
+
 class Solution:
     def getSum(self, a, b):
         """

509.fibonacci-number.py

@@ -1,3 +1,11 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 509.fibonacci-number.py
+# @Software: PyCharm
+
+
 class Solution:
     def fib1(self, N):
         """

521.longest-uncommon-subsequence-i.py

@@ -1,3 +1,11 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 521.longest-uncommon-subsequence-i.py
+# @Software: PyCharm
+
+
 class Solution:
     def findLUSlength(self, a, b):
         """

784.Letter Case Permutation.py

@@ -0,0 +1,39 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 784.Letter Case Permutation.py
+# @Software: PyCharm
+
+
+class Solution:
+    def letterCasePermutation(self, S: 'str') -> 'List[str]':
+        result = []
+        if S == "":
+            return [""]
+        print(result)
+        for i in S:
+            if i.isalpha():
+                if result == []:
+                    result.append(i.lower())
+                    result.append(i.upper())
+                else:
+                    temp = []
+                    temp = result[:]
+                    for j in range(len(result)):
+                        result[j] += i.lower()
+                        temp[j] += i.upper()
+                    result = result + temp
+
+            else:
+                if result == []:
+                    result.append(i)
+                else:
+                    for j in range(len(result)):
+                        result[j] += i
+        return result
+
+
+if __name__ == '__main__':
+    S = "a1b2"
+    print(Solution().letterCasePermutation(S))

806.repeated_n_times.py

@@ -1,3 +1,11 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 806.repeated_n_times.py
+# @Software: PyCharm
+
+
 class Solution:
     def repeatedNTimes1(self, A):
         """

933.number-of-recent-calls.py

@@ -1,3 +1,10 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 933.number-of-recent-calls.py
+# @Software: PyCharm
+
 import collections
 
 

961.number_of_lines.py

@@ -1,3 +1,11 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 961.number_of_lines.py
+# @Software: PyCharm
+
+
 import math
 class Solution:
     def numberOfLines1(self, widths, S):

977.squares-of-a-sorted-array.py

@@ -1,3 +1,11 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : 977.squares-of-a-sorted-array.py
+# @Software: PyCharm
+
+
 class Solution(object):
     def sortedSquares(self, A):
         """

KMP.py

@@ -0,0 +1,44 @@
+# -*- coding: utf-8 -*-
+# @Time    : 2019/2/25 11:46
+# @Author  : xulzee
+# @Email   : [email protected]
+# @File    : KMP.py
+# @Software: PyCharm
+
+
+def get_next(s: 'str'):
+    next_list = [-1] * len(s)
+    i, j = 0, -1
+    while i < len(s) - 1:
+        if j == -1 or s[i] == s[j]:
+            i += 1
+            j += 1
+            if s[i] == s[j]:
+                next_list[i] = next_list[j]
+            else:
+                next_list[i] = j
+        else:
+            j = next_list[j]
+    print(next_list)
+    return next_list
+
+
+def index_kmp(s: 'str', t: 'str'):
+    i, j = 0, 0
+    next_list = get_next(t)
+    while i < len(s) and j < len(t):
+        if j == -1 or s[i] == t[j]:
+            j += 1
+            i += 1
+        else:
+            j = next_list[j]
+    if j >= len(t):
+        return i - len(t)
+    else:
+        return 0
+
+
+if __name__ == '__main__':
+    s, t = 'qwewacdabcasd','abc'
+    print(index_kmp(s, t))
+