牛客err

分类

题解(4)

/ 注册

TA的专栏 20篇文章 0人订阅

数据结构练习

20篇文章 132人学习

全部文章（共162篇）

题解 | #斐波那契数列#

class Solution: def Fibonacci(self , n: int) -> int: dp = [0]*n dp[0], dp[1] = 1, 1 for i in range(2, n): d...

2024-08-27

0 80

题解 | #矩阵最长递增路径#

class Solution: # 记录四个方向 dirs = [[-1, 0], [1, 0], [0, -1], [0, 1]] def dfs(self, matrix: List[List[int]], dp: List[List[int]], i: int, j:...

2024-08-27

0 104

题解 | #括号生成#

class Solution: def generateParenthesis(self, n: int) -> List[str]: def backtrack(path, left, right, res): if len(path) == ...

2024-08-27

0 121

题解 | #字符串的排列#

class Solution: def Permutation(self , str1: str): s = list(str1) output = [] n = len(s) def func(first): ...

2024-08-27

0 93

题解 | #岛屿数量#

class Solution: def solve(self, grid): if not grid: return 0 rows = len(grid) cols = len(grid[0]) cou...

2024-08-27

0 114

题解 | #有重复项数字的全排列#

class Solution: def permuteUnique(self, num: List[int]) -> List[List[int]]: def backtrack(first): if first == n: ...

2024-08-26

0 88

题解 | #数组中只出现一次的两个数字#

# # 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 # # # @param nums int整型一维数组 # @return int整型一维数组 # class Solution: def FindNumsAppearOnce(self , nums: L...

2024-08-26

0 75

题解 | #验证IP地址#

class Solution: def solve(self, IP: str) -> str: def is_ipv4(ip): parts = ip.split(".") if len(parts)...

2024-08-26

0 92

题解 | #大数加法#

class Solution: def solve(self, s: str, t: str) -> str: # 反转字符串，使得可以从最低位开始相加 s, t = s[::-1], t[::-1] result = [] ...

2024-08-25

0 74

题解 | #最长公共前缀#

class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: if not strs: return "" # 取第一个字符串作...

2024-08-25

1 84