搜索结果
查询Tags标签： Binary，共有 164条记录-
python 判断两个IP同网段
1、判断IP同网段方法，两个IP分别与子网掩码相与，所得结果相同即为同网段IP2、子网掩码规则：转为二进制后前部分全1，后半部分全0，掩码不可全1或全0，不可有0位于1前##将IP地址转为二进制def ipToBinary(ip):ip address transformat into binaryArgv:ip: ip addressRet…
2021/9/2 12:06:19 人评论 次浏览 -
python 判断两个IP同网段
1、判断IP同网段方法，两个IP分别与子网掩码相与，所得结果相同即为同网段IP2、子网掩码规则：转为二进制后前部分全1，后半部分全0，掩码不可全1或全0，不可有0位于1前##将IP地址转为二进制def ipToBinary(ip):ip address transformat into binaryArgv:ip: ip addressRet…
2021/9/2 12:06:19 人评论 次浏览 -
0297. Serialize and Deserialize Binary Tree (H)
Serialize and Deserialize Binary Tree (H) 题目 Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be rec…
2021/8/30 23:08:11 人评论 次浏览 -
0297. Serialize and Deserialize Binary Tree (H)
Serialize and Deserialize Binary Tree (H) 题目 Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be rec…
2021/8/30 23:08:11 人评论 次浏览 -
0124. Binary Tree Maximum Path Sum (H)
Binary Tree Maximum Path Sum (H) 题目 A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need t…
2021/8/27 6:09:03 人评论 次浏览 -
0124. Binary Tree Maximum Path Sum (H)
Binary Tree Maximum Path Sum (H) 题目 A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need t…
2021/8/27 6:09:03 人评论 次浏览 -
14 二叉树的中序遍历（Binary Tree Preorder Traversal）
目录1 题目2 描述3 解决方案3.1 递归算法3.1.1 遍历法（Traverse）思路源码3.1.2 分治法（Devide And Conquer）思路源码3.2 非递归算法3.2.1 二叉树遍历的非递归通用解法思路源码图解3.3 时间复杂度3.4 空间复杂度 1 题目二叉树的中序遍历（Binary Tree Preorder Travers…
2021/8/27 6:07:29 人评论 次浏览 -
14 二叉树的中序遍历（Binary Tree Preorder Traversal）
目录1 题目2 描述3 解决方案3.1 递归算法3.1.1 遍历法（Traverse）思路源码3.1.2 分治法（Devide And Conquer）思路源码3.2 非递归算法3.2.1 二叉树遍历的非递归通用解法思路源码图解3.3 时间复杂度3.4 空间复杂度 1 题目二叉树的中序遍历（Binary Tree Preorder Travers…
2021/8/27 6:07:29 人评论 次浏览 -
13 二叉树的前序遍历（Binary Tree Preorder Traversal）
目录1 题目2 描述3 解决方案3.1 递归算法3.1.1 遍历法（Traverse）思路源码3.1.2 分治法（Devide And Conquer）思路源码3.2 非递归算法3.2.1 二叉树遍历的非递归通用解法思路源码图解3.2.2 前序遍历的非递归解法二思路源码3.2.3 前序遍历的非递归解法三思路源码3.3 时间复…
2021/8/21 6:06:14 人评论 次浏览 -
13 二叉树的前序遍历（Binary Tree Preorder Traversal）
目录1 题目2 描述3 解决方案3.1 递归算法3.1.1 遍历法（Traverse）思路源码3.1.2 分治法（Devide And Conquer）思路源码3.2 非递归算法3.2.1 二叉树遍历的非递归通用解法思路源码图解3.2.2 前序遍历的非递归解法二思路源码3.2.3 前序遍历的非递归解法三思路源码3.3 时间复…
2021/8/21 6:06:14 人评论 次浏览 -
PAT (Advanced Level) Practice 1151 LCA in a Binary Tree (30 分) 凌宸1642
PAT (Advanced Level) Practice 1151 LCA in a Binary Tree (30 分) 凌宸1642 题目描述： The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. Given any two nodes in a binary tree, you are…
2021/8/20 6:06:19 人评论 次浏览 -
PAT (Advanced Level) Practice 1151 LCA in a Binary Tree (30 分) 凌宸1642
PAT (Advanced Level) Practice 1151 LCA in a Binary Tree (30 分) 凌宸1642 题目描述： The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. Given any two nodes in a binary tree, you are…
2021/8/20 6:06:19 人评论 次浏览 -
Leetcode No.94 Binary Tree Inorder Traversal二叉树中序遍历(c++实现）
1. 题目 https://leetcode.com/problems/binary-tree-inorder-traversal/ 2. 分析 2.1 迭代法 class Solution { public:vector<int> inorderTraversal(TreeNode* root) {vector<int> ans;stack<TreeNode*> todo;//定义一个栈，先入后出while (root != …
2021/8/19 22:05:39 人评论 次浏览 -
Leetcode No.94 Binary Tree Inorder Traversal二叉树中序遍历(c++实现）
1. 题目 https://leetcode.com/problems/binary-tree-inorder-traversal/ 2. 分析 2.1 迭代法 class Solution { public:vector<int> inorderTraversal(TreeNode* root) {vector<int> ans;stack<TreeNode*> todo;//定义一个栈，先入后出while (root != …
2021/8/19 22:05:39 人评论 次浏览 -
OPENCV FOR PYTHON 学习笔记 - 图像梯度 Laplacian算子
Laplacian算子：类似于二阶sobel导数。实际上，在opencv中通过调用sobel算子来计算拉普拉斯算子。 Laplace函数实现的方法：先用Sobel 算子计算二阶 x 和 y 导数，再求和。应用层面，我们先看与一下该函数的原型:dst = cv2.Laplacian(src, ddepth[, dst[, ksize[, scale[,…
2021/8/19 17:36:14 人评论 次浏览
