2 JNingWei

尚未进行身份认证

职场新人

等级
TA的排名 857

基础网络 (Basemodel) 综述

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

2019-01-23 12:35:55

目标检测 (Detection) 算法综述

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

2019-01-23 11:25:46

python: 经典排序 汇总

冒泡排序defbubble_sort(x):foriinrange(len(x)):forjinrange(1,len(x)-i):ifx[j-1]>x[j]:x[j-1],x[j]=x[j],x[j-1]returnx插入排序definsert_sor...

2018-11-08 11:22:11

leetcode: 449. Serialize and Deserialize BST

DifficultyMedium.ProblemSerializationistheprocessofconvertingadatastructureorobjectintoasequenceofbitssothatitcanbestoredinafileormemorybuffer,ortransmittedacrossane...

2018-11-08 11:17:44

leetcode: 215. Kth Largest Element in an Array

DifficultyMedium.ProblemFindthekthlargestelementinanunsortedarray.Notethatitisthekthlargestelementinthesortedorder,notthekthdistinctelement.Example1:Input:[3,2,1,5,6...

2018-11-08 11:16:00

leetcode: 206. Reverse Linked List

DifficultyEasy.ProblemReverseasinglylinkedlist.Example:Input:1->2->3->4->5->NULLOutput:5->4->3->2->1->NULLFollowup:Alinkedlistcanbereversedeither...

2018-11-08 11:14:21

leetcode: 144. Binary Tree Preorder Traversal

DifficultyMedium.ProblemGivenabinarytree,returnthepreordertraversalofitsnodes'values.Example:Input:[1,null,2,3]1\2/3Output:[1,2,3]Followup:Recursiveso...

2018-11-08 11:12:15

leetcode: 141. Linked List Cycle

DifficultyEasy.ProblemGivenalinkedlist,determineifithasacycleinit.Followup:Canyousolveitwithoutusingextraspace?AC#Definitionforsingly-linkedlist.#classListNode(objec...

2018-11-08 11:09:57

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

DifficultyEasy.ProblemSayyouhaveanarrayforwhichtheithelementisthepriceofagivenstockondayi.Designanalgorithmtofindthemaximumprofit.Youmaycompleteasmanytransactions...

2018-11-08 11:07:36

leetcode: 129. Sum Root to Leaf Numbers

DifficultyEasy.ProblemSayyouhaveanarrayforwhichtheithelementisthepriceofagivenstockondayi.Designanalgorithmtofindthemaximumprofit.Youmaycompleteasmanytransactions...

2018-11-08 11:01:33

leetcode: 121. Best Time to Buy and Sell Stock

DifficultyEasy.ProblemSayyouhaveanarrayforwhichtheithelementisthepriceofagivenstockondayi.Ifyouwereonlypermittedtocompleteatmostonetransaction(i.e.,buyoneandsel...

2018-11-07 09:13:07

leetcode: 120. Triangle

DifficultyMedium.ProblemGivenatriangle,findtheminimumpathsumfromtoptobottom.Eachstepyoumaymovetoadjacentnumbersontherowbelow.Forexample,giventhefollowingtriangle[...

2018-11-07 09:11:22

leetcode: 119. Pascal's Triangle II

DifficultyEasy.ProblemGivenanon-negativeindexkwherek≤33,returnthekthindexrowofthePascal'striangle.Notethattherowindexstartsfrom0.InPascal'striangle,eachnumberisth...

2018-11-07 09:09:42

leetcode: 118. Pascal's Triangle

DifficultyEasy.ProblemGivenanon-negativeintegernumRows,generatethefirstnumRowsofPascal'striangle.InPascal'striangle,eachnumberisthesumofthetwonumbersdirectlyaboveit.Ex...

2018-11-07 09:06:57

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

DifficultyMedium.ProblemGivenabinarytreestructTreeLinkNode{TreeLinkNode*left;TreeLinkNode*right;TreeLinkNode*next;}Populateeachnextpointertopointtoitsnextrightnode....

2018-11-07 09:04:16

leetcode: 116. Populating Next Right Pointers in Each Node

DifficultyMedium.ProblemGivenabinarytreestructTreeLinkNode{TreeLinkNode*left;TreeLinkNode*right;TreeLinkNode*next;}Populateeachnextpointertopointtoitsnextrightnode.I...

2018-11-07 09:02:28

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

DifficultyMedium.ProblemGivenabinarytree,flattenittoalinkedlistin-place.Forexample,giventhefollowingtree:1/\25/\\346Theflattenedtreeshouldlookli...

2018-11-07 08:59:32

leetcode: 113. Path Sum II

DifficultyMedium.ProblemGivenabinarytreeandasum,findallroot-to-leafpathswhereeachpath'ssumequalsthegivensum.Note:Aleafisanodewithnochildren.Example:Giventhebelowb...

2018-11-07 08:56:01

leetcode: 112. Path Sum

DifficultyEasy.ProblemGivenabinarytreeandasum,determineifthetreehasaroot-to-leafpathsuchthataddingupallthevaluesalongthepathequalsthegivensum.Note:Aleafisanodew...

2018-11-07 08:53:51

leetcode: 111. Minimum Depth of Binary Tree

DifficultyEasy.ProblemGivenabinarytree,finditsminimumdepth.Theminimumdepthisthenumberofnodesalongtheshortestpathfromtherootnodedowntothenearestleafnode.Note:Aleaf...

2018-11-07 08:51:39

查看更多

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