101. Symmetric Tree

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 symmet...

2018-03-28 22:34:47

阅读数:27

评论数:0

100. Same Tree

Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally ident...

2018-03-28 22:22:30

阅读数:20

评论数:0

226. Invert Binary Tree

Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9to 4 / \ 7 2 / \ / \ 9 6 3 1Trivia:This problem was inspir...

2018-03-28 22:13:31

阅读数:20

评论数:0

111. Minimum Depth of Binary Tree

Given 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 l...

2018-03-28 21:55:09

阅读数:24

评论数:0

104. Maximum Depth of Binary Tree

Given 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 l...

2018-03-28 21:48:54

阅读数:17

评论数:0

107. Binary Tree Level Order Traversal II

Given 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 ...

2018-03-26 22:00:36

阅读数:18

评论数:0

102. Binary Tree Level Order Traversal

Given 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...

2018-03-26 21:27:50

阅读数:10

评论数:0

145. Binary Tree Postorder Traversal

Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3  ret...

2018-03-25 16:08:30

阅读数:12

评论数:0

94. Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3 return...

2018-03-25 16:03:52

阅读数:16

评论数:0

144. Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3 retur...

2018-03-25 15:59:35

阅读数:14

评论数:0

71. Simplify Path

Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"pat...

2018-03-25 15:48:02

阅读数:10

评论数:0

150. Evaluate Reverse Polish Notation

Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another e...

2018-03-25 14:19:18

阅读数:13

评论数:0

20. Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the ...

2018-03-25 13:41:03

阅读数:11

评论数:0

基于深度学习的目标检测及场景文字检测研究进展

根据本人组会PPT总结整理,复习备用。一.目标检测与场景文字检测定义目标检测:给定一张图片或者视频帧,找出其中所有目标的位置,并给出每个目标的具体类别。场景文字检测:文字检测(Text Detection):对照片中存在文字的区域进行定位,即找到单词或者文本行(word/linelevel)的边界...

2018-03-17 21:19:02

阅读数:1926

评论数:0

[Python爬虫]爬取新浪理财师股票问答

本文将与大家分享如何爬取新浪理财师股票问答。一.背景介绍1)爬取顺序:在这里,根据已有的股票id列表,按照顺序,依次爬取每只股票下面的股票问答。股票id格式:lines = ['300592.XSHE', '300604.XSHE', '002852.XSHE', '603603.XSHG', '...

2018-03-14 21:12:01

阅读数:41

评论数:0

Bounding-box Regression详解

  转自http://caffecn.cn/?/question/160,作者沁心风雨。在此记录,供自己复习。     R-CNN系列文章(Fast/ Faster RCNN)都训练了Bounding-box 回归器来对窗口进行校正,以提高最终的检测精度。那么这样做的好处是什么?具体的又该怎样去做...

2018-03-13 21:09:14

阅读数:54

评论数:0

445. Add Two Numbers II

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes conta...

2018-03-12 22:17:15

阅读数:24

评论数:0

2. Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes conta...

2018-03-12 21:44:15

阅读数:39

评论数:0

328. Odd Even Linked List

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not th...

2018-03-12 21:17:24

阅读数:24

评论数:0

86. Partition List

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the ...

2018-03-12 20:51:24

阅读数:23

评论数:0

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