码迷,mamicode.com
首页 >  
搜索关键字:swap nodes in pairs    ( 8848个结果
Binary Tree Level Order Traversal II
这道题A的略烦Binary Tree Level Order Traversal IIGiven a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right...
分类:其他好文   时间:2014-11-09 15:09:19    阅读次数:238
Transform a BST to greater sum tree
Given a BST, transform it into greater sum tree where each node contains sum of all nodes greater than that node.自己想的复杂了,其实就是一个反向的inorder。新的值就是前面所有元素的...
分类:其他好文   时间:2014-11-09 15:07:49    阅读次数:186
分区命令parted
[root@localhost~]#manpartedpartedisadiskpartitioningandpartitionresizingprogram.Itallowsyoutocreate,destroy,resize,moveandcopyext2,linux-swap,FAT,FAT32,andreiserfsparti-tions.Itcancreate,resize,andmoveMacintoshHFSpartitions,aswellasdetectjfs,ntfs,ufs,andxfs..
分类:其他好文   时间:2014-11-09 06:25:46    阅读次数:307
Leetcode-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 ...
分类:其他好文   时间:2014-11-09 06:13:51    阅读次数:122
Minimum no. of iterations to pass information to all nodes in the tree
Given a very large n-ary tree. Where the root node has some information which it wants to pass to all of its children down to the leaves with the cons...
分类:其他好文   时间:2014-11-09 06:13:47    阅读次数:177
Binary Tree Preorder Traversal
Binary Tree Preorder TraversalGiven a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ...
分类:其他好文   时间:2014-11-08 23:36:00    阅读次数:202
【LeetCode】Binary Tree Inorder Traversal
题意: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively?...
分类:其他好文   时间:2014-11-08 19:43:46    阅读次数:188
【LeetCode]Binary Tree Preorder Traversal
题意: Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively?...
分类:其他好文   时间:2014-11-08 13:41:21    阅读次数:155
leetcode 4.Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类:其他好文   时间:2014-11-07 23:12:58    阅读次数:238
调整linux内核尽量用内存,而不用swap
线上一台服务器kswapd0占用大量的cpu资源,导致负载过高,什么是kswapd0?Linuxuseskswapdforvirtualmemorymanagementsuchthatpagesthathavebeenrecentlyaccessedarekeptinmemoryandlessactivepagesarepagedouttodisk.(whatisapage?)…Linuxusesmanagesmemoryinunitscalledpage..
分类:系统相关   时间:2014-11-07 15:08:01    阅读次数:275
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!