牛客err

分类

题解(4)

/ 注册

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

数据结构练习

20篇文章 132人学习

全部文章（共162篇）

题解 | #识别有效的IP地址和掩码并进行分类统计#

import sys res = [0]*7 def func1(ip): # a-e 0-4 if 1 <= ip[0] <= 126: res[0] += 1 elif 128 <= ip[0] <= 191: res[1]...

2024-08-30

0 110

题解 | #设计LRU缓存结构#

class Node: def __init__(self, key, value): self.key = key # 节点的键 self.value = value # 节点的值 self.prev = None # ...

2024-08-29

0 116

题解 | #编辑距离(一)#

class Solution: def editDistance(self, str1: str, str2: str) -> int: m, n = len(str1), len(str2) dp = [[0] * (n + 1) for ...

2024-08-29

0 90

题解 | #序列化二叉树#

# -*- coding:utf-8 -*- # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None c...

2024-08-29

0 94

题解 | #数字字符串转化成IP地址#

class Solution: def restoreIpAddresses(self , s: str) -> List[str]: res = [] i = 1 n = len(s) while i ...

2024-08-28

0 82

题解 | #滑动窗口的最大值#

class Solution: def maxInWindows(self , num: List[int], size: int) -> List[int]: try: res = [] n = len(num) ...

2024-08-28

0 106

题解 | #主持人调度（二）#

import heapq class Solution: def minmumNumberOfHost(self, n: int, startEnd: List[List[int]]) -> int: # 根据活动的开始时间对活动进行排序 ...

2024-08-28

0 96

题解 | #顺时针旋转矩阵#

class Solution: def rotateMatrix(self , mat: List[List[int]], n: int) -> List[List[int]]: for i in range(n): #　先按照对角线交换 for...

2024-08-28

0 100

题解 | #旋转数组#

class Solution: def solve(self , n: int, m: int, a: List[int]) -> List[int]: def func(i, j): while i < j: ...

2024-08-28

0 83

题解 | #打家劫舍(二)#

class Solution: def rob1(self , nums: List[int]) -> int: n = len(nums) if n == 0: return 0 elif n == 1: ...

2024-08-28

0 90