Exponentiation
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6948 Accepted Submission(s): 1967
Problem Description
Problems inv...
分类：
其他好文 时间：
2014-09-15 22:52:49
阅读次数：
166
Problem Description
It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. F...
分类：
其他好文 时间：
2014-09-15 17:47:39
阅读次数：
183
原题地址：http://oj.leetcode.com/problems/swap-nodes-in-pairs/Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2...
分类：
编程语言 时间：
2014-09-15 06:38:18
阅读次数：
200
原题地址：https://oj.leetcode.com/problems/reverse-linked-list-ii/题意：Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Gi...
分类：
编程语言 时间：
2014-09-14 23:38:47
阅读次数：
239
原题地址：https://oj.leetcode.com/problems/add-two-numbers/题意：You are given two linked lists representing two non-negative numbers. The digits are stored i...
分类：
编程语言 时间：
2014-09-14 23:17:17
阅读次数：
292
原题地址：https://oj.leetcode.com/problems/candy/题意：There areNchildren standing in a line. Each child is assigned a rating value.You are giving candies to ...
分类：
编程语言 时间：
2014-09-14 11:21:16
阅读次数：
172
原题地址：https://oj.leetcode.com/problems/gas-station/题意：There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You ha...
分类：
编程语言 时间：
2014-09-14 11:19:36
阅读次数：
221
The 3n + 1 problemBackgroundProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recur...
分类：
其他好文 时间：
2014-09-14 11:18:37
阅读次数：
178
原题地址：https://oj.leetcode.com/problems/plus-one/题意：Given a non-negative number represented as an array of digits, plus one to the number.The digits are...
分类：
编程语言 时间：
2014-09-14 05:47:06
阅读次数：
218
原题地址：https://oj.leetcode.com/problems/rotate-image/题意：You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Fo...
分类：
编程语言 时间：
2014-09-14 02:29:46
阅读次数：
245
