- 博客(19)
- 收藏
- 关注
RSS订阅原创 ( Leetcode 107 ) Binary Tree Level Order Traversal II
题目： Binary Tree Level Order Traversal IIGiven 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 e
2016-05-28 16:44:01
5795
( Leetcode 107 ) Binary Tree Level Order Traversal II
题目：Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exam...
2016-05-28 16:44:00
78
原创 ( Leetcode 104 ) Maximum Depth of Binary Tree
题目：Maximum Depth of Binary TreeGiven 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.
2016-05-28 16:15:42
5720
( Leetcode 104 ) Maximum Depth of Binary Tree
题目：Maximum Depth of Binary TreeGiven 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....
2016-05-28 16:15:00
88
原创 ( Leetcode 23 ) Merge k Sorted Lists
题目：Merge k Sorted ListsMerge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.解题思路：这道题的主要解题思路类似于归并排序，分和拆，同样这道题也分为两大部分，第一大部分主要解决拆分链表的问题，将链表按照两两为一对
2016-05-15 21:13:23
6854
( Leetcode 23 ) Merge k Sorted Lists
题目：Merge k Sorted ListsMerge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.解题思路：这道题的主要解题思路类似于归并排序，分和拆，同样这道题也分为两大部分，第一大部分主要解决拆分链表的问题，将链表按照两两为一对进行拆分...
2016-05-15 21:13:00
74
( Leetcode 23 ) Merge k Sorted Lists
题目：Merge k Sorted ListsMerge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.解题思路：这道题的主要解题思路类似于归并排序，分和拆，同样这道题也分为两大部分，第一大部分主要解决拆分链表的问题，将链表按照两两为一对进行拆分...
2016-05-15 21:13:00
68
原创 ( Leetcode 21 ) Merge Two Sorted Lists （高效解法）
题目：Merge Two Sorted Lists Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.解题思路：虽然这道题比较简单，首先人人都能
2016-05-13 20:23:18
6741
( Leetcode 21 ) Merge Two Sorted Lists
题目：Merge Two Sorted ListsMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.解题思路：虽然这道题比较简单，首先人人都能想到最基本...
2016-05-13 20:23:00
104
( Leetcode 21 ) Merge Two Sorted Lists
题目：Merge Two Sorted ListsMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.解题思路：虽然这道题比较简单，首先人人都能想到最基本...
2016-05-13 20:23:00
55
原创 ( Leetcode 25 ) Reverse Nodes in k-Group
题目：Reverse Nodes in k-GroupGiven a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the
2016-05-08 21:40:35
6704
( Leetcode 25 ) Reverse Nodes in k-Group
题目：Reverse Nodes in k-GroupGiven a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the...
2016-05-08 21:40:00
115
( Leetcode 25 ) Reverse Nodes in k-Group
题目：Reverse Nodes in k-GroupGiven a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the...
2016-05-08 21:40:00
77
转载 关于DBN的理解
关于DBN我一直有以下三个问题：1.什么是complementary priors？2.为什么说RBM展开后可以当成sigmoid belief network with tied parameters呢？3.为什么Greedy Layerwise Training可以把DBN的每层当成RBM来训练呢？经过这几天的冥思苦想，我得出来了一些对于我个人来说比较可以接受的解释，这
2016-05-06 16:27:59
11951
1
关于DBN的理解
关于DBN我一直有以下三个问题：1.什么是complementary priors？2.为什么说RBM展开后可以当成sigmoid belief network with tied parameters呢？3.为什么Greedy Layerwise Training可以把DBN的每层当成RBM来训练呢？经过这几天的冥思苦想，我得出来了一些对于我个人来说比较可以接受的解释，...
2016-05-06 16:27:00
958
关于DBN的理解
关于DBN我一直有以下三个问题：1.什么是complementary priors？2.为什么说RBM展开后可以当成sigmoid belief network with tied parameters呢？3.为什么Greedy Layerwise Training可以把DBN的每层当成RBM来训练呢？经过这几天的冥思苦想，我得出来了一些对于我个人来说比较可以接受的解释，...
2016-05-06 16:27:00
292
原创 ( Leetcode 61 ) Rotate List
题目：Rotate ListGiven a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.解题思路：1. 首先求的
2016-05-03 20:07:49
6517
( Leetcode 61 ) Rotate List
题目：Rotate ListGiven a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NU...
2016-05-03 20:07:00
65
( Leetcode 61 ) Rotate List
题目：Rotate ListGiven a list, rotate the list to the right bykplaces, wherekis non-negative.For example:Given1->2->3->4->5->NULLandk=2,return4->5->1->2->3->NU...
2016-05-03 20:07:00
84
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人