- 博客(47)
- 收藏
- 关注
RSS订阅
原创 python leetcode目录
慢慢更新ingleetcode1-10 : https://blog.csdn.net/aaa12389zhx/article/details/113785849
2021-02-11 01:28:32
188
1
原创 本博客内容(看了你就知道我要干什么)
本博客暂时只更新python版的leetocde答案,每日一题每天必更,剩下的每10题一更.写完就贴出来.hard题看情况可能不写,因为实在不会(嘤嘤嘤,我太菜了).欢迎大家交流.希望大家都不咸鱼.一起努力 √ .
2021-02-10 21:00:01
71
原创 python leetcode 421-430
# 421class Solution: def findMaximumXOR(self, nums: List[int]) -> int: res, mask = 0, 0 for i in range(31, -1, -1): mask = mask | (1<<i) #从高位开始的掩码 s = set() for num in nums: .
2021-06-28 09:21:53
131
原创 python leetcode 411-420
# 412class Solution: def fizzBuzz(self, n: int) -> List[str]: res = [] for i in range(1 , n + 1): if i % 3 == 0 and i % 5 != 0: res.append('Fizz') elif i % 3 != 0 and i % 5 == 0: .
2021-06-02 22:40:29
113
原创 python leetcode 401-410
# 401class Solution: def readBinaryWatch(self, num: int) -> List[str]: res = [] for h in range(12): for m in range(60): if bin(h).count("1") + bin(m).count("1") == num: res.append("{}.
2021-05-23 23:30:43
119
原创 python leetcode 391-400
# 392class Solution: def isSubsequence(self, s: str, t: str) -> bool: i , j = 0 , 0 while i < len(s) and j < len(t): if s[i] == t[j]: i += 1 j += 1 else: .
2021-05-22 00:28:56
90
原创 python leetcode 381-390
# 383class Solution: def canConstruct(self, ransomNote: str, magazine: str) -> bool: R = Counter(ransomNote) M = Counter(magazine) for i in R: if R[i] > M[i]: return False return True.
2021-05-15 11:18:59
90
原创 python leetcode 371-380
# 371 (life is short)class Solution: def getSum(self, a: int, b: int) -> int: return sum([a,b])# 372class Solution: def superPow(self, a: int, b: List[int]) -> int: if not b: return 1 tmp = b.pop() return.
2021-05-15 10:32:28
104
原创 python leetcode 361-370
# 361class Solution: def maxKilledEnemies(self, grid: List[List[str]]) -> int: if not grid or not grid[0]: return 0 m , n , res = len(grid) , len(grid[0]) , 0 def count(x , y): tmp = 0 fo.
2021-05-13 19:44:35
134
原创 python leetcode 351-360
# 354class Solution: def maxEnvelopes(self, envelopes: List[List[int]]) -> int: envelopes.sort(key = lambda x : (x[0] , -x[1])) res = [] for _ , y in envelopes: toc = bisect_left(res , y) res[toc:toc.
2021-05-08 17:47:25
141
原创 python leetcode 341-350
# 341class NestedIterator(object): def dfs(self, nests): for nest in nests: if nest.isInteger(): self.queue.append(nest.getInteger()) else: self.dfs(nest.getList()) .
2021-05-07 17:52:51
112
原创 python leetcode 331-340
# 331class Solution(object): def isValidSerialization(self, preorder): stack = [] for node in preorder.split(','): stack.append(node) while len(stack) >= 3 and stack[-1] == stack[-2] == '#' and stack[-3] != .
2021-05-06 20:56:42
128
原创 python leetcode 321-330
# 321# 322class Solution: def coinChange(self, coins: List[int], amount: int) -> int: dp = [float('inf')] * (amount + 1) dp[0] = 0 for i in range(amount + 1): for j in coins: if j <= i: .
2021-05-06 13:55:26
96
原创 python leetcode 311-320
# 311class Solution: def multiply(self, A: List[List[int]], B: List[List[int]]) -> List[List[int]]: l1 , l2 = len(A) , len(B) if l1 == 0 or l2 == 0: return[] c1 , c2 = len(A[0]) , len(B[0]) res = [[0 for.
2021-04-28 16:03:12
81
原创 python leetcode 301-310
# 302class Solution: def minArea(self, image: List[List[str]], x: int, y: int) -> int: length = [] width = [] for i in range(len(image)): for j in range(len(image[0])): if image[i][j] == '1': .
2021-04-25 00:19:17
100
原创 python leetcode 291-300
# 291class Solution: def wordPatternMatch(self, pattern: str, s: str) -> bool: if not pattern or not s: #因为题目要求的对应关系都是非空的 return False self.char_word = defaultdict(str) self.word_char = defaultdic.
2021-04-23 16:58:37
118
原创 python leetcode 281-290
# 281class ZigzagIterator: def __init__(self, v1: List[int], v2: List[int]): self.v1 = v1 self.v2 = v2 self.length1 = len(v1) self.length2 = len(v2) self.index1 = 0 self.index2 = 0 self.row_poin.
2021-04-23 00:03:32
107
原创 python leetcode 271-280
# 272class Solution: def closestKValues(self, root: TreeNode, target: float, k: int) -> List[int]: def getTree(root,li,k): if root==None: return getTree(root.left,li,k) if len(li)==k: .
2021-04-21 18:46:22
146
原创 python leetcode 261-270
# 261class UnionFind: def __init__(self, n): self.n = n self.part = n self.parent = [x for x in range(n)] self.size = [1 for _ in range(n)] def Find(self, x: int) -> int: if self.parent[x] == x: .
2021-04-20 12:22:21
98
原创 python leetcode 251-260
class Vector2D: def __init__(self, v: List[List[int]]): self.vector = v self.inner = 0 self.outer = 0 def advance_to_next(self): while self.outer < len(self.vector) and self.inner == len(self.vector[self.outer]):.
2021-04-17 00:26:24
143
1
原创 python leetcode 241-250
# 241class Solution: def diffWaysToCompute(self, s : str) -> List[int]: if s.isdigit(): return [int(s)] res = [] for i, c in enumerate(s): if c in '+-*': for left in self.diffWaysToCompute(s[:i]).
2021-04-16 20:58:12
142
原创 python leetcode 231-240
# 231class Solution: def isPowerOfTwo(self, n: int) -> bool: if n <= 0: return False while n > 1: if n % 2 != 0: return False n /= 2 return True# 232class MyQueu.
2021-04-14 22:56:40
81
原创 python leetcode 221-230
# 221class Solution: def maximalSquare(self, matrix: List[List[str]]) -> int: if not matrix:return 0 row = len(matrix) col = len(matrix[0]) dp = [[0] * (col + 1) for _ in range(row + 1)] res = 0 for .
2021-04-13 20:52:06
48
原创 python leetcode 211-220
# 212 太难了抄的官方class Solution: def findWords(self, board: List[List[str]], words: List[str]) -> List[str]: WORD_KEY = '$' trie = {} for word in words: node = trie for letter in word: # .
2021-04-10 00:09:29
77
原创 python leetcode 201-210
# 201class Solution: def rangeBitwiseAnd(self, m: int, n: int) -> int: i = 0 while m != n: m >>= 1 n >>= 1 i += 1 return m << i# 202class Solution: def isHappy(s.
2021-04-07 16:53:39
127
1
原创 python leetcode 191-200
# 191class Solution: def hammingWeight(self, n: int) -> int: return bin(n).count("1")# 198class Solution: def rob(self, nums): n = len(nums) if n == 1: return nums[0] if n == 0: retur.
2021-04-07 00:55:16
56
原创 python leetcode 181-190
# 186class Solution: def reverseWords(self, string: List[str]) -> None: """ Do not return anything, modify s in-place instead. """ string[:] = list(" ".join(''.join(string).split(' ')[::-1]))# 187class Solution:.
2021-04-06 20:10:10
60
原创 python leetcode 171-180
# 171class Solution: def titleToNumber(self, s: str) -> int: res = 0 bit = 1 for a in s[::-1]: res += (ord(a) - 64) * bit bit *= 26 return res# 172class Solution: def trailingZeroes(s.
2021-04-06 17:08:13
62
原创 python leetcode 161-170
# 161class Solution: def isOneEditDistance(self, s: str, t: str) -> bool: if abs(len(s) - len(t)) > 1: return False if len(s) == len(t): tmp = 0 for i in range(len(s)): if s[i].
2021-04-01 23:12:44
95
原创 python leetcode 151-160
# 151class Solution: def reverseWords(self, s: str) -> str: return ' '.join(s.split()[::-1])# 152class Solution: def maxProduct(self, nums: List[int]) -> int: reverse_nums = nums[::-1] for i in range(1 , len(nums.
2021-03-30 03:45:02
304
原创 python leetcode 141-150
# 141class Solution: def hasCycle(self, head: ListNode) -> bool: fast , slow = head , head while fast and fast.next: fast = fast.next.next slow = slow.next if fast == slow: return Tru.
2021-03-27 23:10:17
57
原创 python leetcode 131-140
# 131class Solution: def partition(self, s: str) -> List[List[str]]: n = len(s) dp = [[False] * n for _ in range(n)] for i in range(n): dp[i][i] = True for j in range(1, n): for i in range(j).
2021-03-24 17:03:29
104
原创 python leetcode 121-130
# 121class Solution: def maxProfit(self, prices): if not prices: return 0 res , tmp = 0 , prices[0] for i in prices: if i < tmp: tmp = i res = max(res , i - tmp) .
2021-03-22 22:13:45
94
原创 python leetcode 111-120
# 111# Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution: def minDepth(self, root: TreeNode) -&.
2021-03-20 20:53:06
57
原创 python leetcode 101-110
# 101# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: def isSymmetric(self, root: TreeNode) -> bool: if not r.
2021-03-18 09:03:19
76
原创 python leetcode 91-100
# 91class Solution: def numDecodings(self, s: str) -> int: dp = [0] * len(s) if s[0] == '0': return 0 else: dp[0] = 1 if len(s) == 1: return 1 if s[1] != '0': .
2021-03-10 23:22:06
67
原创 python leetcode 81-90
# 81class Solution: def search(self, nums, target): l , r = 0 , len(nums) - 1 while l <= r: mid = l + (r - l) // 2 if nums[mid] == target: return True if nums[mid] == nums[l] == n.
2021-03-03 04:23:19
150
2
原创 python leetcode 71-80
# 71class Solution: def simplifyPath(self, path): path = path.split('/') stack = [] for i in path: if i == '..': if stack: stack.pop() elif i and i != '.': .
2021-02-25 17:37:38
77
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人