- 博客(5)
- 收藏
- 关注
转载 google Inception v1 - v4 papers 发展历程
google Inception v1 - v4 papers 发展历程转自:http://blog.csdn.net/u010025211/article/details/51206237先上Paper列表:[v1] Going Deeper with Convolutions, 6.67% test error, http://arxiv.org/abs/1409.
2016-10-25 10:28:22 744
原创 [LeetCode] Binary Tree Inorder Traversal
question:Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3],解题思路:递归vector res; void inorder(TreeNode *root) {
2016-10-25 10:17:33 361
原创 [LeetCode] Missing Number
question:Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.解题思路: the mi
2016-10-25 10:13:46 325
原创 [LeetCode] Single Number III
question:Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example
2016-10-25 10:10:14 282
原创 [LeetCode] Maximum Depth of Binary Tree
question: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 leaf node.解题思路: 递归求解,返回较大深度int maxD
2016-10-25 10:06:14 337
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人