码迷,mamicode.com
首页 >  
搜索关键字:median of two sorted    ( 17004个结果
CTCI 2.4
Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x.Use two addit...
分类:其他好文   时间:2014-07-09 17:44:36    阅读次数:159
CTCI 2.5
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the Ts d...
分类:其他好文   时间:2014-07-09 15:35:19    阅读次数:176
整形提升(c语言基础)
When you use an arithmetic operator, the operands go through two conversions.Integer promotions: If int can represent all values of the type, then the...
分类:编程语言   时间:2014-07-09 13:46:00    阅读次数:278
[LeetCode]Merge Sorted Array
[LeetCode]Merge Sorted Array...
分类:其他好文   时间:2014-07-09 11:15:07    阅读次数:221
POJ2406-Power Strings(kmp循环节)
Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 31111   Accepted: 12982 Description Given two strings a and b we define a*b to be their concate...
分类:其他好文   时间:2014-07-09 11:11:53    阅读次数:155
Cracking the Coding Interview Q1.8
Assume you have a method isSubstring which checks if one word is a substring of another. Given two strings, s1 and s2, write code to check if s2 is a ...
分类:其他好文   时间:2014-07-08 21:44:23    阅读次数:177
POJ-1475-Pushing Boxes(BFS)
Description Imagine you are standing inside a two-dimensional maze composed of square cells which may or may not be filled with rock. You can move north, south, east or west one cell at a step. T...
分类:其他好文   时间:2014-07-08 21:04:29    阅读次数:347
Cracking the Coding Interview Q2.5
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1’s ...
分类:其他好文   时间:2014-07-08 13:34:40    阅读次数:195
POJ1753:Flip Game
Flip Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 29713   Accepted: 12876 Description Flip game is played on a rectangular 4x4 field with two-sided...
分类:其他好文   时间:2014-07-08 13:32:49    阅读次数:189
HDU 4587 TWO NODES (双连通割点应用)
题意:N个点(0~n-1),M条无向边,问去掉2个点后最多的连通分块有多少。 先去掉一个点求出各个割点,并在dfs过程中求出去掉这个割点有多少个连通分块(将iscut[u]=true改为iscut[u]++), 这样子第二次就可以直接找出最多的连通分块了。 #include #include #include #include #include #include #inclu...
分类:其他好文   时间:2014-07-08 13:06:23    阅读次数:145
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!