- 博客(81)
- 收藏
- 关注
RSS订阅原创 常见docker使用命令
content”: “你是由谁训练的”“content”: “你是由谁训练的”“content”: “你是由谁训练的”#进入docker容器。#查看docker日志。
2024-04-02 19:23:20
981
1
原创 算法、机器学习校招面试题总结
1.判别式、生成式模型生成式：朴素贝叶斯、HMM、Gaussians、马尔科夫随机场判别式：LR，SVM，神经网络，CRF，Boosting生成模型：先从数据中学习联合概率分布,然后利用贝叶斯公式求得特征和标签对应的条件概率分布。判别模型：直接学习条件概率分布,直观的输入什么特征就预测可能的类别。【朴素贝叶斯】优点朴素贝叶斯算法假设了数据集属性之间是相互独立的，因此算法的逻辑性十分简单，并且算法较为稳定，当数据呈现不同的特点时，朴素贝叶斯的分类性能不会有太大的差异。换句话说就是朴素贝叶斯算法
2023-03-09 19:33:34
5708
原创 根据前序遍历和中序遍历重建二叉树
# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = None## 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可## # @param pre int整型一维数组 # @param vin int整型一维数组 # @return TreeNode类#class Solution.
2022-05-03 22:45:04
262
原创 判断一棵二叉树是否为搜索二叉树和完全二叉树
# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = None## # @param root TreeNode类 the root# @return bool布尔型一维数组#import collectionsclass Solution: def judgeIt(self , root ):.
2022-05-02 23:35:30
492
原创 美团2021校招笔试-小团无路可逃
def count(): n, x, y = list(map(int, input().split())) graph = [[] for _ in range(n + 1)] for i in range(n - 1): x1, x2 = list(map(int, input().split())) graph[x1].append(x2) graph[x2].append(x1) # 存储着x/y到index需.
2022-04-30 00:08:42
284
原创 Leetcode-516最长回文子序列 leetcode5-最长回文子串
class Solution: def longestPalindromeSubseq(self, s: str) -> int: dp = [[0] * len(s) for _ in range(len(s))] for i in range(len(s)-1, -1, -1): dp[i][i] = 1 for j in range(i + 1, len(s)): if s.
2022-04-08 14:05:51
218
原创 Leetcode-面试题08.09.括号
class Solution: def generateParenthesis(self, n: int) -> List[str]: if n <= 0: return [] res = [] def dfs(paths, left, right): if left > n or right > left: return if len(paths) == n * 2: # .
2022-04-08 09:42:45
332
原创 Leetcode-416 分割等和子集
class Solution: def canPartition(self, nums: List[int]) -> bool: if sum(nums) % 2 != 0 : return False target = sum(nums) // 2 dp = [False] * (target + 1) dp[0] = True for num in nums: for i in ran.
2022-04-03 23:51:27
73
原创 Leetcode-322 零钱兑换
class Solution(object): def coinChange(self, coins, amount): """ :type coins: List[int] :type amount: int :rtype: int """ if amount == 0: return 0 coins.sort() if coins[0] > amount: r.
2022-04-02 09:57:07
496
原创 Leetcode-875爱吃香蕉的珂珂
class Solution: def minEatingSpeed(self, piles: List[int], h: int) -> int: def check(k): hours = 0 for num in piles: hours += ceil(num / k) return hours <= h left, right = max(.
2022-04-01 00:34:39
332
原创 Leetcode-703 数据流中的第K大元素
class KthLargest: def __init__(self, k: int, nums: List[int]): self.HEAP = [] self.size = k for num in nums: self._push(num) def _push(self, num): if len(self.HEAP) < self.size: heap.
2022-03-31 23:52:12
143
原创 Leetcode-85 最大矩形
class Solution: def maximalRectangle(self, matrix: List[str]) -> int: if not matrix:return 0 m,n=len(matrix),len(matrix[0]) # 记录当前位置上方连续“1”的个数 pre=[0]*(n+1) res=0 for i in range(m): for j .
2022-03-31 23:36:28
83
原创 Leetcode-173 二叉搜索树迭代器
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass BSTIterator(object): def __init__(self, root.
2022-03-31 19:48:05
68
原创 Leetcode-124 二叉树中的最大路径和
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution(object): def maxPathSum(self, root):.
2022-03-31 19:31:03
335
原创 Leetcode-926 将字符串翻转到单调递增
class Solution(object): def minFlipsMonoIncr(self, s): """ :type s: str :rtype: int """ lis = [int(x) for x in list(s)] n, sum_One, front_One = len(lis), sum(lis), 0 # 数组长度，数组中1的个数，遇到过的1的个数 ans .
2022-03-31 11:06:18
173
原创 Leetcode-213 打家劫舍2
class Solution: def rob(self, nums: [int]) -> int: def my_rob(nums): cur, pre = 0, 0 for num in nums: cur, pre = max(pre + num, cur), cur return cur return max(my_rob(nums[:-1]),my.
2022-03-28 14:28:01
298
原创 Leetcode-198 打家劫舍
class Solution: def rob(self, nums: List[int]) -> int: cur, pre = 0, 0 for num in nums: cur, pre = max(pre + num, cur), cur return cur
2022-03-28 14:25:47
120
原创 Leetcode-1143 最长公共子序列
class Solution(object): def longestCommonSubsequence(self, text1, text2): """ :type text1: str :type text2: str :rtype: int """ m = len(text1) n = len(text2) dp = [[0]*(n+1) for _ in ran.
2022-03-22 16:13:04
272
原创 Leetcode-540 有序数组中的单一元素
class Solution: def singleNonDuplicate(self, nums: List[int]) -> int: low, high = 0, len(nums) - 1 while low < high: mid = (low + high) // 2 if nums[mid] == nums[mid ^ 1]: low = mid + 1 .
2022-03-21 12:08:16
93
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人