- 博客(10)
- 收藏
- 关注
RSS订阅原创 hihocoder #1309 : 任务分配
//http://www.spoj.com/MIT071/problems/ROMANRDS/ #pragma comment(linker, "/STACK:102400000,102400000") #include #include #include #include #include #include //#include #include #include #incl
2016-08-12 19:49:47
453
原创 273. Integer to English Words
Task: Given an integer (signed 32 bits), write a function to check whether it is a power of 4. Example: Given num = 16, return true. Given num = 5, return false. Follow up: Could
2016-04-19 10:30:34
225
原创 273. Integer to English Words
Task: Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. For example, 123 -> "One Hundred Twenty Three" 12345 -> "T
2016-04-14 20:05:59
259
原创 41. First Missing Positive
Task: Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and
2016-03-21 10:51:09
248
原创 19. Remove Nth Node From End of List
Task: Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from
2016-03-14 16:01:46
239
原创 331. Verify Preorder Serialization of a Binary Tree
Task: One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as
2016-03-07 20:11:35
320
原创 66. Plus One
Task: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. Some Questi
2016-03-01 16:09:57
286
原创 334. Increasing Triplet Subsequence
Task: Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, k such that
2016-02-28 17:01:37
438
2
原创 计算客第一场，初赛。
第一题，按照题目意思模拟即可，注意0k0E。要输出0k0 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma comment(
2015-07-18 15:02:29
444
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人