- 博客(754)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 leetcode: 120. Triangle
DifficultyMedium.ProblemGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ ...
2018-11-07 09:11:22
223
原创 leetcode: 119. Pascal's Triangle II
DifficultyEasy.ProblemGiven a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.Note that the row index starts from 0.In Pascal's triangle, each number is th...
2018-11-07 09:09:42
255
原创 leetcode: 118. Pascal's Triangle
DifficultyEasy.ProblemGiven a non-negative integer numRows, generate the first numRows of Pascal's triangle.In Pascal's triangle, each number is the sum of the two numbers directly above it.Ex...
2018-11-07 09:06:57
208
原创 leetcode: 117. Populating Next Right Pointers in Each Node II
DifficultyMedium.ProblemGiven a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to point to its next right node. ...
2018-11-07 09:04:16
449
原创 leetcode: 116. Populating Next Right Pointers in Each Node
DifficultyMedium.ProblemGiven a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to point to its next right node. I...
2018-11-07 09:02:28
337
原创 leetcode: 114. Flatten Binary Tree to Linked List [✗]
DifficultyMedium.ProblemGiven a binary tree, flatten it to a linked list in-place.For example, given the following tree: 1 / \ 2 5 / \ \3 4 6The flattened tree should look li...
2018-11-07 08:59:32
391
原创 leetcode: 113. Path Sum II
DifficultyMedium.ProblemGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Note: A leaf is a node with no children.Example:Given the below b...
2018-11-07 08:56:01
240
原创 leetcode: 112. Path Sum
DifficultyEasy.ProblemGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Note: A leaf is a node w...
2018-11-07 08:53:51
353
原创 leetcode: 111. Minimum Depth of Binary Tree
DifficultyEasy.ProblemGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.Note: A leaf ...
2018-11-07 08:51:39
221
原创 leetcode: 110. Balanced Binary Tree
DifficultyEasy.ProblemGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as:a binary tree in which the depth of the two subtrees ...
2018-11-05 17:13:29
222
原创 leetcode: 109. Convert Sorted List to Binary Search Tree
DifficultyMedium.ProblemGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as ...
2018-11-05 17:11:26
153
原创 leetcode: 108. Convert Sorted Array to Binary Search Tree
DifficultyEasy.ProblemGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree ...
2018-11-05 17:09:17
168
原创 leetcode: 107. Binary Tree Level Order Traversal II
DifficultyEasy.ProblemGiven a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary t...
2018-11-05 17:07:14
156
原创 leetcode: 106. Construct Binary Tree from Inorder and Postorder Traversal
DifficultyMedium.ProblemGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, giveninorder = [9...
2018-11-05 17:03:30
172
原创 leetcode: 105. Construct Binary Tree from Preorder and Inorder Traversal
DifficultyMedium.ProblemGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, givenpreorder = [3...
2018-11-05 17:01:10
229
原创 leetcode: 104. Maximum Depth of Binary Tree
DifficultyEasy.ProblemGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Note: A leaf ...
2018-11-05 16:58:17
187
原创 leetcode: 103. Binary Tree Zigzag Level Order Traversal
DifficultyMedium.ProblemGiven a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).Fo...
2018-11-05 16:45:59
170
原创 leetcode: 102. Binary Tree Level Order Traversal
DifficultyMedium.ProblemGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7...
2018-11-05 16:38:22
190
原创 leetcode: 101. Symmetric Tree
DifficultyEasy.Problem# Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).## For example, this binary tree [1,2,2,3,4,4,3] is symmetric:## 1# ...
2018-11-05 16:35:42
208
原创 论文阅读: FPN
Introduction文章开篇即指出，现有的三种 Scale handling 方法都不好。Featurized image pyramid 计算开销和存储开销都太大： 基于深度网络的检测算法出来之前，检测算法基本都是基于这种scale handling；后来出现的SNIP、SNIPER也是基于Image Pyramid。Single feature map 框不出小物体： ...
2018-06-12 10:31:07
2152
1
原创 论文阅读: Soft-NMS
Introduction传统的Non-Maximum Supression去重过程如下： 但是对于两个“高度重合的object”，却容易“误杀”，导致只剩下一个bbox： Innovation针对传统的NMS计算公式： Bharat Singh等人提出了soft版的NMS： 即： 不再删除所有与highest-score的bbox大于IoU阈值的框，而改为降...
2018-06-11 10:45:19
1624
原创 论文阅读: DCN
Introduction传统的CNN中，convolution 和 pooling 的操作已被定死。只能在方正死板的区域内按部就班地映射操作： 这种设计显然对于现实场景中遇到ratio(比例)和rotation(旋转角度)多变的的非刚体object，是不够general的。那么怎么办呢？传统的回避途径有以下两个：根据先验 加数据：根据先验信息，增加training datase...
2018-06-10 16:12:48
7411
3
原创 机器学习: Metric Learning (度量学习)
[1] Wikipedia-距离函数 [2] DistLearnKit [3] 基于深度学习的Person Re-ID（度量学习） [4] 度量学习 [5] 度量学习（Distance Metric Learning）介绍
2018-06-10 15:07:27
25701
4
原创 论文阅读: R-FCN-3000
IntroductionInnovationResultThinking[1] R-FCN-3000 at 30fps: Decoupling Detection and Classification
2018-06-10 11:24:45
590
原创 论文阅读: Light-head R-CNN
IntroductionInnovationResultThinking[1] Light-Head R-CNN: In Defense of Two-Stage Object Detector
2018-06-09 17:44:25
973
1
原创 论文阅读: R-FCN
IntroductionInnovationResultThinking[1] R-FCN: Object Detection via Region-based Fully Convolutional Networks [2] [3] [4]
2018-06-09 13:10:43
1601
原创 论文阅读: Cascade R-CNN
Introduction传统的Faster R-CNN结构如下： 在train阶段，其最终的输出结果是通过如下一个简单的IoU阈值判断来决定哪些proposal作为output： 对IoU阈值设置的探索由于早前VOC只以 mAP50mAP50mAP_{50} 作为唯一的性能衡量标准，为了overfit该数据集，算法的IoU阈值在train阶段和inference阶段常被简单...
2018-06-08 14:33:42
5404
11
原创 论文阅读: Speed/accuracy trade-offs
IntroductionInnovationResultThinking[1] Speed/accuracy trade-offs for modern convolutional object detectors
2018-06-07 13:55:57
1816
原创 论文阅读: SNIP
IntroductionInnovationResultThinking[1] An Analysis of Scale Invariance in Object Detection - SNIP
2018-05-20 10:54:20
3276
原创 论文阅读: R-CNN
IntroductionInnonvationResultThinking[1] Rich feature hierarchies for accurate object detection and semantic segmentation
2018-05-15 15:36:31
601
原创 硬件: 高性价比的 工作站配置 列表
配置表 配件 型号 单价 数量 汇总 18250 机箱 先马 黑洞 中塔式 280 1 主板 技嘉 Z370 1500 1 CPU 英特尔 i7 8700K 酷睿六核 2800 1 独显 微星MSI GTX1080ti 11GB 7500 1 内存 金士顿 ...
2018-05-13 14:45:10
4423
原创 如何把 网页 转换为 PDF
ctrl + b 进入 打印界面： 选择使用预览程序打开PDF： 在左上角的文件一栏选择导出为PDF： 选择存储地址： 点击确定，即可生成PDF文件： [1] 谷歌浏览器Chrome把网页转换成pdf文件...
2018-05-13 14:09:45
2678
原创 Tmux 使用
InstallationmacOS下： brew install tmuxUsage 快捷键 作用 control + b 进入控制台 % 左右平分出两个窗格 “ 上下平分出两个窗格 x 关闭当前窗格 { 当前窗格前移 } 当前窗格后移 ; 选择上次使用的窗格 o ...
2018-05-13 13:52:32
294
转载 硬件: RFID (射频识别)
Introduction本节摘自Wikipedia-射频识别：射频识别（英语：Radio Frequency IDentification，缩写：RFID）是一种无线通信技术，可以通过无线电讯号识别特定目标并读写相关数据，而无需识别系统与特定目标之间建立机械或者光学接触。无线电的信号是通过调成无线电频率的电磁场，把数据从附着在物品上的标签上传送出去，以自动辨识与追踪该物品。某些标签在识...
2018-05-12 16:55:35
1214
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人