3 JNingWei

尚未进行身份认证

暂无相关简介

等级
TA的排名 844

基础网络 (Basemodel) 综述

以下是我在2018年7月份找工作时,根据个人所学总结出的基础网络 (basemodel) 综述。其中,仅仅挑出我认为比较重要的一系列基础网络,按照时间顺序进行简要概述。如有阐述不对的地方,恳请指出。LeNet时间1998意义标志着 CNN 的真正面世。优点在字符识别上取得了高于 99%的准确率。缺点当时没有 GPU,训练LeNet 极耗时;非 OCR 的任务上,甚...

2019-01-23 12:35:55

目标检测 (Detection) 算法综述

以下是我在2018年7月份找工作时,总结个人所学写出的目标检测算法综述。其中,仅仅挑出我认为比较重要的一系列算法,按照时间顺序进行简要概述。如有阐述不对的地方,恳请指出。R-CNN:【时间】2013【意义】鼻祖级CNN detector。真正实现了“将检测任务转换为分类任务”。检测算法的主流由传统模型转为CNN模型。CVPR2014。【创新点】解决了两大问题:1. 如何定位;2.如何在...

2019-01-23 11:25:46

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[j-1], x[j] = x[j], x[j-1] return x插入排序def insert_sor...

2018-11-08 11:22:11

leetcode: 449. Serialize and Deserialize BST

DifficultyMedium.ProblemSerialization 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 ne...

2018-11-08 11:17:44

leetcode: 215. Kth Largest Element in an Array

DifficultyMedium.ProblemFind the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.Example 1:Input: [3,2,1,5,6...

2018-11-08 11:16:00

leetcode: 206. Reverse Linked List

DifficultyEasy.ProblemReverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLFollow up:A linked list can be reversed either ...

2018-11-08 11:14:21

leetcode: 144. Binary Tree Preorder Traversal

DifficultyMedium.ProblemGiven a binary tree, return the preorder traversal of its nodes' values.Example:Input: [1,null,2,3] 1 \ 2 / 3Output: [1,2,3]Follow up: Recursive so...

2018-11-08 11:12:15

leetcode: 141. Linked List Cycle

DifficultyEasy.ProblemGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?AC# Definition for singly-linked list.# class ListNode(objec...

2018-11-08 11:09:57

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

DifficultyEasy.ProblemSay 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 maximum profit. You may complete as many transactions ...

2018-11-08 11:07:36

leetcode: 129. Sum Root to Leaf Numbers

DifficultyEasy.ProblemSay 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 maximum profit. You may complete as many transactions...

2018-11-08 11:01:33

leetcode: 121. Best Time to Buy and Sell Stock

DifficultyEasy.ProblemSay 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 complete at most one transaction (i.e., buy one and sel...

2018-11-07 09:13:07

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

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

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

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

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

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

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

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

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

查看更多

勋章 我的勋章
  • GitHub
    GitHub
    绑定GitHub第三方账户获取
  • 专栏达人
    专栏达人
    授予成功创建个人博客专栏的用户。专栏中添加五篇以上博文即可点亮!撰写博客专栏浓缩技术精华,专栏达人就是你!
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!