码迷,mamicode.com
首页 >  
搜索关键字:swap nodes in pairs    ( 8848个结果
POJ 3096-Surprising Strings(set)
Surprising Strings Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5940   Accepted: 3894 Description The D-pairs of a string of letters are the ordered pairs...
分类:其他好文   时间:2014-09-01 12:34:43    阅读次数:234
leetcode - Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-...
分类:其他好文   时间:2014-09-01 12:15:43    阅读次数:169
UVA - 11077 Find the Permutations (置换)
Sorting is one of the most usedoperations in real life, where Computer Science comes into act. It iswell-known that the lower bound of swap based sorting is nlog(n).It means that the best possible sor...
分类:其他好文   时间:2014-09-01 10:50:23    阅读次数:234
LeetCode: Binary Tree Inorder Traversal
LeetCode: Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}...
分类:其他好文   时间:2014-08-31 22:38:11    阅读次数:215
[leecode]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-08-31 18:34:41    阅读次数:180
[leetcode]Binary Tree InorderTraversal
Binary Tree Inorder TraversalGiven a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ...
分类:其他好文   时间:2014-08-31 18:27:01    阅读次数:168
Merge Two Sorted Lists <LeetCode>
---恢复内容开始---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 lis...
分类:其他好文   时间:2014-08-31 17:01:51    阅读次数:270
冒泡排序
8.冒泡排序算法的时间复杂度是什么? 时间复杂度是O(n^2)。 1 #include "stdafx.h" 2 #include 3 using namespace std; 4 void Swap(int &a, int &b) 5 { 6 int temp = a; 7 a ...
分类:其他好文   时间:2014-08-31 10:23:51    阅读次数:133
LeetCode——Reverse Nodes in k-Group
Given 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 end should remain as it is...
分类:其他好文   时间:2014-08-30 11:14:19    阅读次数:209
zabbix导航栏自定义Label、Zatree在新浏览器新标签页打开的方法
1.vim$zabbix_PATH/include/menu.inc.php284行增加以下内容284‘zatree‘=>array(285‘label‘=>_(‘Zatree‘),286‘user_type‘=>USER_TYPE_ZABBIX_USER,287‘default_page_id‘=>0,288‘force_disable_all_nodes‘=>true,289‘pages‘=>array(290array(‘url‘=>‘http:/..
分类:其他好文   时间:2014-08-30 02:28:09    阅读次数:1092
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!