码迷,mamicode.com
首页 >  
搜索关键字:two pointer    ( 13796个结果
div 多列登高对齐
.detail_row?{ ????overflow?:hidden; ????font-size?:12px; } .detail_col_one,?.detail_col_two,?.detail_col_three,?.detail_col_four,.one-row-label,?.one-row-content?{ ????margin-bo...
分类:其他好文   时间:2014-08-06 02:06:20    阅读次数:1254
Word Ladder II leetcode java
题目:Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can b....
分类:编程语言   时间:2014-08-06 01:52:30    阅读次数:251
Matrix multiplication hdu4920
Problem DescriptionGiven two matrices A and B of size n×n, find the product of them.bobo hates big integers. So you are only asked to find the result ...
分类:其他好文   时间:2014-08-06 01:43:40    阅读次数:334
Word Ladder leetcode java
题目:Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter...
分类:编程语言   时间:2014-08-06 01:35:30    阅读次数:389
uva 103 Stacking Boxes(最长上升子序列)
DescriptionStacking BoxesBackgroundSome concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when ...
分类:其他好文   时间:2014-08-06 01:32:20    阅读次数:275
HDU - 4911 Inversion
Problem Description bobo has a sequence a1,a2,…,an. He is allowed to swap two adjacent numbers for no more than k times. Find the minimum number of inversions after his swaps. Note: The number...
分类:其他好文   时间:2014-08-05 22:44:03    阅读次数:248
HDU 4920 Matrix multiplication
Problem Description Given two matrices A and B of size n×n, find the product of them. bobo hates big integers. So you are only asked to find the result modulo 3.   Input The input consists of...
分类:其他好文   时间:2014-08-05 22:38:00    阅读次数:248
POJ 3356 AGTC (编辑距离 DP)
Description Let x and y be two strings over some finite alphabet A. We would like to transform x into y allowing only operations given below: Deletion: a letter in x is missing in y at a corr...
分类:其他好文   时间:2014-08-05 19:32:50    阅读次数:247
UVa11324 - The Largest Clique(DAG+DP+SCC)
Problem B: The Largest Clique Given a directed graph G, consider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Create a directed edge between two ve...
分类:其他好文   时间:2014-08-05 19:26:40    阅读次数:365
Leetcode | Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo...
分类:其他好文   时间:2014-08-05 18:54:19    阅读次数:282
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!