码迷,mamicode.com
首页 >  
搜索关键字:codevs 1503 愚蠢的宠物 解题报告    ( 3864个结果
LeetCode: Add Two Numbers 解题报告
Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes co...
分类:其他好文   时间:2014-10-20 18:50:54    阅读次数:111
LeetCode: Word Break II 解题报告
Word Break IIGiven a string s and a dictionary of words dict, add spaces in s toconstruct a sentence where each word is a valid dictionaryword.Return ...
分类:其他好文   时间:2014-10-20 17:10:28    阅读次数:466
LeetCode: Reverse Nodes in k-Group 解题报告
Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o...
分类:其他好文   时间:2014-10-20 14:46:35    阅读次数:230
【LeetCode】Find Minimum in Rotated Sorted Array 解题报告
【题目】 Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. You may assume no duplicate...
分类:其他好文   时间:2014-10-20 11:51:28    阅读次数:239
【LeetCode】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...
分类:其他好文   时间:2014-10-19 21:25:37    阅读次数:247
Distinct Subsequences 解题报告
题目:给两个字符串S和T,判断T在S中出现的次数。 A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ACE" is a subsequence...
分类:其他好文   时间:2014-10-19 17:09:51    阅读次数:190
[wikioi]线段树练习
http://codevs.cn/problem/1080/#include #include #include using namespace std;const int MAXN = 100000;struct Line { int left, right; int n;};Line...
分类:其他好文   时间:2014-10-19 11:31:33    阅读次数:165
[wikioi]线段树练习 2
http://codevs.cn/problem/1081/#include #include #include using namespace std;const int MAXN = 100000;struct Line { int left, right; int n;};Line...
分类:其他好文   时间:2014-10-19 11:21:49    阅读次数:199
POJ 1047 Round and Round We Go 最详细的解题报告
题目链接:Round and Round We Go解题思路:用程序实现一个乘法功能,将给定的字符串依次做旋转,然后进行比较。由于题目比较简单,所以不做过多的详解。具体算法(java版,可以直接AC) 1 import java.util.Scanner; 2 3 public class ...
分类:其他好文   时间:2014-10-19 10:09:34    阅读次数:179
POJ 1063 Flip and Shift 最详细的解题报告
题目来源:Flip and Shift题目大意:一个椭圆形的环形容器中有黑色和白色两种盘子,问你是否可以将黑色的盘子连续的放在一起。你可以有以下两种操作:1、顺时针旋转所有的盘子2、顺时针旋转3个盘子解题思路:第一种操作表明你可以对任意一个盘子执行第二种操作,所以重点在于第二种操作。仔细分析一下会发...
分类:其他好文   时间:2014-10-19 10:07:51    阅读次数:174
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!