leetcode
个人原代码,无详细说明,题目请到官网找
Tk.lgy
这个作者很懒,什么都没留下…
展开
-
1002. Find Common Characters (python3)
class Solution: def commonChars(self, A): B = set(A[0]) result = [] for i in B: n = min([a_word.count(i) for a_word in A]) if n: res...原创 2019-11-13 09:41:43 · 191 阅读 · 0 评论 -
1200. Minimum Absolute Difference (python3)
class Solution: def minimumAbsDifference(self, arr): temple = sorted(arr) minimumAbs = abs(temple[1] - temple[0]) dict = {} dict[minimumAbs] = [] dict[minim...原创 2019-11-12 09:09:19 · 248 阅读 · 0 评论 -
1160. Find Words That Can Be Formed by Characters (python3)
class Solution: def countCharacters(self, words, chars): B = [] copy_char = chars for i in words: chars = copy_char length = 0 for j in ...原创 2019-11-12 09:08:22 · 179 阅读 · 0 评论 -
1122. Relative Sort Array (python3)
class Solution: def relativeSortArray(self, arr1, arr2): same = [] notin = [] for i in arr1: if i in arr2: same.append(i) else: ...原创 2019-11-12 09:07:21 · 198 阅读 · 0 评论 -
1051. Height Checker (python3)
class Solution: def heightChecker(self, heights): B = sorted(heights) print(B) count = 0 for i in range(len(B)): if B[i] != heights[i]: ...原创 2019-11-12 09:06:22 · 169 阅读 · 0 评论 -
977. Squares of a Sorted Array (python3)
class Solution: def sortedSquares(self, A): A = (i**2 for i in A) return sorted(A, key=lambda x: x)原创 2019-11-12 09:05:21 · 219 阅读 · 0 评论 -
922. Sort Array By Parity II(python)
class Solution: def sortArrayByParityII(self, A): B = [] odd = [] even = [] for i in range(len(A)): if A[i] % 2 != 0: odd.append(A[i]) ...原创 2019-11-11 15:45:48 · 146 阅读 · 0 评论 -
905. Sort Array By Parity(python3)
class Solution: def sortArrayByParity(self, A): B = [] for i in range(len(A)): if A[i] % 2 == 0: B.append(A[i]) continue for i i...原创 2019-11-11 15:34:41 · 159 阅读 · 0 评论 -
832. Flipping an Image(python3)
class Solution: def flipAndInvertImage(self, A): # flip B = [[0]*len(A) for r in range(len(A))] for i in range(len(A)): for l, j in zip(range(len(A[i])), range(...原创 2019-11-11 15:19:55 · 101 阅读 · 0 评论 -
561. Array Partition I(python3)
class Solution: def arrayPairSum(self, nums): B = sorted(nums) boundary = int(len(nums)/2) result = 0 for i in range(len(B)-2, -1, -2): result += B[i] ...原创 2019-11-11 13:43:07 · 132 阅读 · 0 评论 -
509. Fibonacci Number(python3)
class Solution: def fib(self, N): a, b = 0, 1 for i in range(N): a, b = b, a + b return a原创 2019-11-11 13:41:12 · 138 阅读 · 0 评论