Yu.Mu

聪明，皮实，乐观，自省

排序：
默认
按更新时间
按访问量
RSS订阅

原 基础网络 (Basemodel) 综述

以下是我在2018年7月份找工作时，根据个人所学总结出的基础网络 (basemodel) 综述。 其中，仅仅挑出我认为比较重要的一系列基础网络，按照时间顺序进行简要概述。 如有阐述不对的地方，恳请指出。 LeNet 时间 1998 意义 标志着 CNN 的真正面世。 优点 在字符识别上取得了...

2019-01-23 12:35:55

阅读数 220

评论数 0

原 目标检测 (Detection) 算法综述

以下是我在2018年7月份找工作时，总结个人所学写出的目标检测算法综述。 其中，仅仅挑出我认为比较重要的一系列算法，按照时间顺序进行简要概述。 如有阐述不对的地方，恳请指出。 R-CNN： 【时间】2013 【意义】鼻祖级CNN detector。真正实现了“将检测任务转换为分类任务”。检测算法的...

2019-01-23 11:25:46

阅读数 355

评论数 0

原 目标检测算法 发展脉络 (Detection-Timeline)

Year Month Algorithm Improve Conference 2013 11 R-CNN 将CNN用于Detection CVPR2014 = = = = = 2014 6 SPPNet ...

2018-04-23 15:24:01

阅读数 550

评论数 0

原 python: 经典排序 汇总

冒泡排序 def bubble_sort(x): for i in range(len(x)): for j in range(1, len(x)-i): if x[j-1] > x[j]: x[...

2018-11-08 11:22:11

阅读数 210

评论数 0

原 leetcode: 449. Serialize and Deserialize BST

Difficulty Medium. Problem Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in ...

2018-11-08 11:17:44

阅读数 130

评论数 0

原 leetcode: 215. Kth Largest Element in an Array

Difficulty Medium. Problem Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the k...

2018-11-08 11:16:00

阅读数 181

评论数 0

原 leetcode: 206. Reverse Linked List

Difficulty Easy. Problem Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL O...

2018-11-08 11:14:21

阅读数 91

评论数 0

原 leetcode: 144. Binary Tree Preorder Traversal

Difficulty Medium. Problem Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 ...

2018-11-08 11:12:15

阅读数 88

评论数 0

原 leetcode: 141. Linked List Cycle

Difficulty Easy. Problem Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? AC # Defini...

2018-11-08 11:09:57

阅读数 70

评论数 0

原 leetcode: 122. Best Time to Buy and Sell Stock II

Difficulty Easy. Problem Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the max...

2018-11-08 11:07:36

阅读数 99

评论数 0

原 leetcode: 129. Sum Root to Leaf Numbers

Difficulty Easy. Problem Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the max...

2018-11-08 11:01:33

阅读数 90

评论数 0

原 leetcode: 121. Best Time to Buy and Sell Stock

Difficulty Easy. Problem Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to compl...

2018-11-07 09:13:07

阅读数 104

评论数 0

原 leetcode: 120. Triangle

Difficulty Medium. Problem Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row bel...

2018-11-07 09:11:22

阅读数 81

评论数 0

原 leetcode: 119. Pascal's Triangle II

Difficulty Easy. Problem Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index start...

2018-11-07 09:09:42

阅读数 67

评论数 0

原 leetcode: 118. Pascal's Triangle

Difficulty Easy. Problem Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number i...

2018-11-07 09:06:57

阅读数 81

评论数 0

原 leetcode: 117. Populating Next Right Pointers in Each Node II

Difficulty Medium. Problem Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate e...

2018-11-07 09:04:16

阅读数 96

评论数 0

原 leetcode: 116. Populating Next Right Pointers in Each Node

Difficulty Medium. Problem Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate e...

2018-11-07 09:02:28

阅读数 108

评论数 0

原 leetcode: 114. Flatten Binary Tree to Linked List [✗]

Difficulty Medium. Problem Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 ...

2018-11-07 08:59:32

阅读数 103

评论数 0

原 leetcode: 113. Path Sum II

Difficulty Medium. Problem Given 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 ...

2018-11-07 08:56:01

阅读数 86

评论数 0

原 leetcode: 112. Path Sum

Difficulty Easy. Problem Given 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 p...

2018-11-07 08:53:51

阅读数 93

评论数 0

提示
确定要删除当前文章？
取消 删除
关闭
关闭