码迷,mamicode.com
首页 >  
搜索关键字:either    ( 1469个结果
POJ 1308 Is It A Tree?(并查集)
Is It A Tree? Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 23255   Accepted: 7977 Description A tree is a well-known data structure that is either empty (...
分类:其他好文   时间:2015-02-07 11:50:01    阅读次数:232
POJ 2195 Going Home
Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little ...
分类:其他好文   时间:2015-02-05 23:24:51    阅读次数:294
LeetCode-Climbing Stairs(爬楼梯问题)
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 第一反应,递归求解,貌似很简单。但是不幸,超时 p...
分类:其他好文   时间:2015-02-05 22:00:41    阅读次数:323
Climbing Stairs
You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb...
分类:其他好文   时间:2015-02-05 13:17:53    阅读次数:175
[LeetCode]64.Minimum Path Sum
【题目】 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down o...
分类:其他好文   时间:2015-02-04 16:34:20    阅读次数:140
[LeetCode]62.Unique Paths
【题目】 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to...
分类:其他好文   时间:2015-02-03 23:00:26    阅读次数:249
《梦断代码》经典语录--持续更新
1. You couldn’t afford the time to perfect anything, but no need to warry , because nobody else could either. 2. Our civilization runs on software—Bja...
分类:其他好文   时间:2015-02-03 21:14:46    阅读次数:205
70.Climbing Stairs(法1递归穷举法2动态规划)
You are climbing a stair case. It takes n steps to reachto the top. Each time you can either climb 1 or 2 steps. In how many distinct ways canyou climb to the top? HideTags  Dynamic Programming ...
分类:其他好文   时间:2015-02-02 23:15:59    阅读次数:283
Unique Paths
本文是在学习中的总结,欢迎转载但请注明出处: 本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/43404205 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at a...
分类:其他好文   时间:2015-02-02 09:37:48    阅读次数:177
SPOJ COT3 Combat on a tree(Trie树、线段树的合并)
题目链接:http://www.spoj.com/problems/COT3/Alice and Bob are playing a game on a tree of n nodes.Each node is either black or white initially.They take tu...
分类:其他好文   时间:2015-02-01 23:19:06    阅读次数:986
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!