码迷,mamicode.com
首页 >  
搜索关键字:nodes    ( 4030个结果
LeetCode:Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your ...
分类:其他好文   时间:2014-06-29 14:39:10    阅读次数:268
jQuery的getText()方法源码
/** * Utility function for retrieving the text value of an array of DOM nodes * @param {Array|Element} elem */ getText = Sizzle.getTex...
分类:Web程序   时间:2014-06-07 03:37:39    阅读次数:240
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-06-04 20:19:49    阅读次数:282
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./***Defin...
分类:其他好文   时间:2014-06-04 19:23:45    阅读次数:243
Partition List
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi...
分类:其他好文   时间:2014-06-03 14:12:24    阅读次数:306
Maximum Depth of Binary Tree
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 le...
分类:其他好文   时间:2014-05-30 15:03:42    阅读次数:237
Coursera Algorithm Part II PA2
题意:computing a max-spacingk-clustering.spacing 是指两个 cluster 之间的最小距离输入:[number_of_nodes][edge 1 node 1] [edge 1 node 2] [edge 1 cost][edge 2 node 1] [e...
分类:其他好文   时间:2014-05-29 20:40:30    阅读次数:323
修改故障转移群集心跳时间
Windows Server Failover Clustering is a high availability platform that is constantly monitoring the network connections and health of the nodes in a ...
分类:其他好文   时间:2014-05-27 23:48:23    阅读次数:550
LeetCode: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 digit. Add the two numbers   and return i...
分类:其他好文   时间:2014-05-25 21:36:52    阅读次数:268
poj 3031 Big Christmas Tree(水spfa)
http://poj.org/problem?id=3013 题意: Because of a technical difficulty, price of an edge will be (sum of weights of all descendant nodes) × (unit price of the edge).这句话一直没看懂。后面还以为是最小生成树。 正确...
分类:其他好文   时间:2014-05-24 20:27:13    阅读次数:266
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!