ACM水题
Joe周鸟
欢迎来微博交流:Joe周鸟
公众号:AISphere
展开
-
ACM水题系列 HDOJ2550
百步穿杨Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3965 Accepted Submission(s): 1354 Problem Description时维九月原创 2014-12-20 00:33:12 · 353 阅读 · 0 评论 -
01(CodeforcesA水平)CQU新生周末狂欢赛C - Business trip
C - Business tripTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 149ADescriptionWhat joy! Petya's parents went on a原创 2014-12-27 15:28:12 · 809 阅读 · 0 评论 -
01(CodeforcesA水平)CQU新生周末狂欢赛B - Insomnia cure
B - Insomnia cureTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 148ADescription«One dragon. Two dragon. Three drag原创 2014-12-27 15:23:15 · 911 阅读 · 0 评论 -
HDU 1073 The area
The areaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1329 Accepted Submission(s): 1058Problem Description原创 2014-12-27 00:05:10 · 352 阅读 · 0 评论 -
codeforces round#283 A
A. Minimum Difficultytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike is trying rock climbing but he i原创 2014-12-27 13:55:44 · 392 阅读 · 0 评论 -
LeetCode 142 与 206
一、 LeetCode 1421.1 哈希解法思路1:用hash表存储,如果遇到重复的节点,则为环的入口。代码如下:class Solution(object): def detectCycle(self, head): if not head: return None hash = {head} ...原创 2018-12-19 21:00:34 · 198 阅读 · 1 评论 -
队列、堆排序与LeetCode 239
一、队列队列是受限的线性表,对元素来讲一般是先进先出。但是双端队列在首尾都有指针,可以实现更多的方便功能。二、堆排序堆排序分成最大堆和最小堆,即以最大值作为根节点或者以最小值作为根节点,但是对于排序来讲,他们的过程相同。首先是将所有元素按顺序组成一颗树。然后从叶子结点到父节点到根节点依次排序,按照大小交换顺序,最终即成有序堆。三、LeetCode 239Given an arr...原创 2018-12-20 21:31:01 · 475 阅读 · 0 评论 -
Leetcode 98、102与107
二叉树遍历二叉树遍历共有前序、中序、后序与层次四种遍历,其中前三种以根出现的位置区分:前序遍历:根->左->右中序遍历:左->根->右后序遍历:左->右->根而层次是从根到子节点最后到叶子结点的层序遍历方法,具体以leetcode 102和107为例。Leetcode 102问题描述如下:Given a binary tree, retu...原创 2018-12-21 21:28:05 · 291 阅读 · 0 评论 -
递归与动态规划
递归思想递归,就是在运行的过程中调用自己。构成递归需具备的条件:函数嵌套调用过程示例函数嵌套调用过程示例子问题须与原始问题为同样的事,且更为简单;不能无限制地调用本身,须有个出口,化简为非递归状况处理。在数学和计算机科学中,递归指由一种(或多种)简单的基本情况定义的一类对象或方法,并规定其他所有情况都能被还原为其基本情况。例如,下列为某人祖先的递归定义:某人的双亲是他的祖先(...原创 2018-12-22 18:17:25 · 305 阅读 · 0 评论 -
Leetcode 17与46
Leetcode 17题目描述:Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telep...原创 2018-12-23 13:45:42 · 152 阅读 · 0 评论 -
01(CodeforcesA水平)CQU新生周末狂欢赛D - Soft Drinking
D - Soft DrinkingTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 151ADescriptionThis winter is so cold in Nvodsk! A原创 2014-12-27 15:32:19 · 497 阅读 · 0 评论 -
水题HDU1108 最小公倍数
最小公倍数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3551 Accepted Submission(s): 2562 Problem Description给定两原创 2014-12-27 01:42:49 · 759 阅读 · 0 评论 -
ACM水题系列 HDOJ 1061
Rightmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6526 Accepted Submission(s): 1688 Problem Descript原创 2014-12-20 00:08:26 · 231 阅读 · 0 评论 -
ACM水题系列 HDOJ2393
Higher MathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5153 Accepted Submission(s): 1663 Problem Description原创 2014-12-20 00:19:42 · 444 阅读 · 0 评论 -
ACM水题系列 HDOJ 1326
Box of BricksTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7586 Accepted Submission(s): 1756 Problem Descriptio原创 2014-12-20 00:01:15 · 559 阅读 · 0 评论 -
ACM水题系列 HDOJ 1064
Financial ManagementTime Limit: 400/200 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3927 Accepted Submission(s): 1889 Problem Descr原创 2014-12-19 23:57:55 · 454 阅读 · 0 评论 -
ACM水题系列 HDOJ2629
Identity CardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4591 Accepted Submission(s): 1412 Problem Descriptio原创 2014-12-20 00:24:09 · 502 阅读 · 0 评论 -
ACM水题系列 HDOJ2093
考试排名Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2624 Accepted Submission(s): 937 Problem DescriptionC++编程原创 2014-12-20 00:38:31 · 522 阅读 · 0 评论 -
ACM水题系列 HDOJ1038
Biker's Trip OdometerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3854 Accepted Submission(s): 1710 Problem De原创 2014-12-19 23:51:51 · 441 阅读 · 0 评论 -
ACM水题系列 HDOJ2673
shǎ崽 OrOrOrOrzTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4085 Accepted Submission(s): 1264 Problem Descripti原创 2014-12-20 00:35:19 · 382 阅读 · 0 评论 -
水题HDU 2138 How many prime numbers
How many prime numbersTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8435 Accepted Submission(s): 2688 Problem D原创 2014-12-27 01:29:19 · 409 阅读 · 0 评论 -
0-1背包问题实现及Leetcode 132
0-1背包问题问题描述给定一组多个(n)物品,每种物品都有自己的重量(wiw_iwi)和价值(viv_ivi),在限定的总重量/总容量(C)内,选择其中若干个(也即每种物品可以选0个或1个),设计选择方案使得物品的总价值最高。思路:定义问题dp(i, W)为前i个物品中,选择的重量不超过W。对于第i个物品,要么不选;要没选,因此dp公式为:dp(i, W) = max(d...原创 2018-12-24 17:41:07 · 1899 阅读 · 0 评论