码迷,mamicode.com
首页 >  
搜索关键字:intval    ( 371个结果
[LeetCode]144 Binary Tree Preorder Traversal
https://oj.leetcode.com/problems/binary-tree-preorder-traversal/http://blog.csdn.net/linhuanmars/article/details/21428647/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){val=x;} *} */ publicclassSolu..
分类:其他好文   时间:2015-01-09 01:52:30    阅读次数:274
[LeetCode]143 Reorder List
https://oj.leetcode.com/problems/reorder-list/http://blog.csdn.net/linhuanmars/article/details/21503215/** *Definitionforsingly-linkedlist. *classListNode{ *intval; *ListNodenext; *ListNode(intx){ *val=x; *next=null; *} *} */ publicclassSolution{ publicvoid..
分类:其他好文   时间:2015-01-09 01:51:44    阅读次数:175
[LeetCode]147 Insertion Sort List
https://oj.leetcode.com/problems/insertion-sort-list/http://blog.csdn.net/linhuanmars/article/details/21144553/** *Definitionforsingly-linkedlist. *publicclassListNode{ *intval; *ListNodenext; *ListNode(intx){ *val=x; *next=null; *} *} */ publicclassSolutio..
分类:其他好文   时间:2015-01-09 01:50:04    阅读次数:172
[LeetCode]124 Binary Tree Maximum Path Sum
https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/http://blog.csdn.net/linhuanmars/article/details/22969069/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){val=x;} *} */ publicclassSoluti..
分类:其他好文   时间:2015-01-07 19:14:02    阅读次数:158
[LeetCode]129 Sum Root to Leaf Numbers
https://oj.leetcode.com/problems/sum-root-to-leaf-numbers/http://blog.csdn.net/linhuanmars/article/details/22913699/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){val=x;} *} */ publicclassSolution{ ..
分类:其他好文   时间:2015-01-07 19:01:24    阅读次数:112
[LeetCode]114 Flatten Binary Tree to Linked List
https://oj.leetcode.com/problems/flatten-binary-tree-to-linked-list/http://blog.csdn.net/linhuanmars/article/details/23717703/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){val=x;} *} */ publicclass..
分类:其他好文   时间:2015-01-06 18:20:38    阅读次数:147
[LeetCode]116 Populating Next Right Pointers in Each Node
https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/http://blog.csdn.net/linhuanmars/article/details/23499383/** *Definitionforbinarytreewithnextpointer. *publicclassTreeLinkNode{ *intval; *TreeLinkNodeleft,right,next; *TreeLinkNode..
分类:其他好文   时间:2015-01-06 18:15:27    阅读次数:170
[LeetCode]117 Populating Next Right Pointers in Each Node II
https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/http://blog.csdn.net/linhuanmars/article/details/23510601/** *Definitionforbinarytreewithnextpointer. *publicclassTreeLinkNode{ *intval; *TreeLinkNodeleft,right,next; *TreeLinkN..
分类:其他好文   时间:2015-01-06 18:14:12    阅读次数:118
[LeetCode]105 Construct Binary Tree from Preorder and Inorder Traversal
https://oj.leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/http://blog.csdn.net/linhuanmars/article/details/24389549/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){va..
分类:其他好文   时间:2015-01-06 15:55:10    阅读次数:101
[LeetCode]106 Construct Binary Tree from Inorder and Postorder Traversal
https://oj.leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/http://blog.csdn.net/linhuanmars/article/details/24390157/** *Definitionforbinarytree *publicclassTreeNode{ *intval; *TreeNodeleft; *TreeNoderight; *TreeNode(intx){v..
分类:其他好文   时间:2015-01-06 15:54:59    阅读次数:138
371条   上一页 1 ... 31 32 33 34 35 ... 38 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!