热衷开源的Boy

LeetCode题目有两个列表的字符串str1 = [“中文”, “苹果”, “pear”] , str2 = [“English”, “apple”, “梨”]以中文为健,英文为值,并且英文首字母大写def is_English(word): '''判断是否为英文''' for i in word: if "a" <= i <= "z" or "A" <= i <= "Z": pass else:

时间超出限制

原题目

class Solution: def countDigitOne(self, n: int) -> int: if n<=0:return 0 str_n=str(n) high=int(str_n[0]) base=10**(len(str_n)-1) last=n%base ...

深度搜索

参考1参考2正则表达式解法状态自动机INT_MAX = 2 ** 31 - 1INT_MIN = -2 ** 31class Automaton: def __init__(self): self.state = 'start' self.sign = 1 self.ans = 0 self.table...

上面方法（冒泡）超时

https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/

第一次在Leetcode上写出这么高质量的代码出来，纪念一下。哈哈哈哈

https://leetcode-cn.com/problems/diameter-of-binary-tree/

动态规划一般解法步骤1 写出状态转移方程2 写出最底层状态3 自下而上遍历

状态转移函数代码此方法具有优化时间复杂度，但空间复杂度较大

超过时间限制的解法

核心思想每一层为一个步骤。

def coinChange(self, coins: List[int], amount: int) -> int: df = [float('inf')]*(amount+1) df[0] = 0 for coin in coins: for n in range(coin,amount+1): ...

class Solution: def distributeCandies(self, candies: int, num_people: int) -> List[int]: List = [0]*num_people flag = 1 num = 1 while flag: for i i...

class Solution: def pathInZigZagTree(self, label: int) -> List[int]: res = [] while label != 1: res.append(label) label >>= 1 # 这里我采用异...

class Solution: def convert(self, s: str, numRows: int) -> str: if numRows==1:return s res = ['' for _ in range(numRows)] i,flag = 0,-1 for c in s: ...

class Solution: def wiggleSort(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. """ for i in range(len(nums)-1): ...

class Solution: def canConstruct(self, ransomNote: str, magazine: str) -> bool: a = list(ransomNote);b = list(magazine) try: for i in a: b.remove(i...

class Solution: def isValidSudoku(self, board: List[List[str]]) -> bool: col = [[] for _ in range(9)] raw = [[] for _ in range(9)] block = [[] for _ in range(9)] ...

import queueclass MaxQueue: def __init__(self): self.deque = queue.deque() def max_value(self) -> int: return max(self.deque) if self.deque else -1 def push_back(se...

import queueclass MaxQueue: def __init__(self): self.deque = queue.deque() def max_value(self) -> int: return max(self.deque) if self.deque else -1 def push_back(se...