小黑南京归来,参加部里的公务员培训,有点儿社死认识了好多小伙伴的leetcode之旅13. 罗马数字转整数_罗马数字i,ii,iii-爱代码爱编程
小黑代码 class Solution: def romanToInt(self, s: str) -> int: chars = ['M', 'CM', 'D', 'CD', 'C', 'X
代码编织梦想
小黑代码 class Solution: def romanToInt(self, s: str) -> int: chars = ['M', 'CM', 'D', 'CD', 'C', 'X
剑指 Offer II 052. 展平二叉搜索树 小黑代码 # Definition for a binary tree node. # class TreeNode: # def __init__(self,
小黑二次遍历 # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): #
小黑代码 class Solution: def containsNearbyAlmostDuplicate(self, nums: List[int], k: int, t: int) -> bool:
小黑代码(与官方题解一致) # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None,
小黑代码(prefect) class Solution: def combinationSum3(self, k: int, n: int) -> List[List[int]]: # 无解
小黑代码 class Solution: def generateParenthesis(self, n: int) -> List[str]: # 结果数组与中间变量 res
多源最短路径 class Solution: def updateMatrix(self, mat: List[List[int]]) -> List[List[int]]: # 矩阵的行和列
小黑代码 class Solution: def findNumberIn2DArray(self, matrix: List[List[int]], target: int) -> bool:
小黑代码:记忆化搜索 class Solution: def climbStairs(self, n: int) -> int: # 记忆字典 map_ = {}
小黑代码:记忆化搜索 class Solution: def uniquePathsWithObstacles(self, obstacleGrid: List[List[int]]) -> int:
小黑代码:递归中序 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, rig
小黑代码 """ # Definition for a Node. class Node: def __init__(self, val=None, children=None): self.val
递归法(Python) # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, r
小黑代码:动态规划 class Solution: def numDecodings(self, s: str) -> int: set_ = set([str(i) for i in ran
递归法 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=Non
小黑代码 # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): #
小黑代码 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=No
按列求(python) class Solution: def trap(self, height: List[int]) -> int: n = len(height) #
小黑代码 # Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=No