Given n non-negative integers representing an
elevation map where the width of each bar is 1, compute how much water it is
able to trap after raining....
分类：
移动开发 时间：
2014-05-19 19:20:26
阅读次数：
332
http://acm.hdu.edu.cn/showproblem.php?pid=3038
1 #include 2 #include 3 #include 4 #define maxn 600000 5 using namespace std; 6
7 int f[maxn],d[max...
分类：
其他好文 时间：
2014-05-19 18:51:33
阅读次数：
252
Construct Binary Tree from Preorder and Inorder
TraversalGiven preorder and inorder traversal of a tree, construct the binary
tree.Note:You may assume...
分类：
其他好文 时间：
2014-05-19 18:43:40
阅读次数：
177
这个问题引发的原因最初的报错是：[2013-10-14 10:01:58 - XXX] The
connection to adb is down, and a severe error has occured.[2013-10-14 10:01:58 -
XXX] You must restart...
分类：
移动开发 时间：
2014-05-19 18:30:21
阅读次数：
336
# How to Read an Engineering Research Paper>
[William G. Griswold](http://cseweb.ucsd.edu/users/wgg/)> Department of
Computer Science & Engineering> U...
分类：
其他好文 时间：
2014-05-19 11:50:50
阅读次数：
204
【题目】
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {...
分类：
其他好文 时间：
2014-05-18 10:37:57
阅读次数：
269
【题目】
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes it...
分类：
其他好文 时间：
2014-05-18 08:37:57
阅读次数：
370
1、
??
ZigZag Conversion
The string "PAYPALISHIRING" is
written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibili...
分类：
其他好文 时间：
2014-05-18 07:56:49
阅读次数：
407
Problem Description
For a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2 * 2 + A1 *
1. Now you are given two numbers A and...
分类：
其他好文 时间：
2014-05-18 06:35:50
阅读次数：
300
3SumClosest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution....
分类：
其他好文 时间：
2014-05-18 05:57:48
阅读次数：
244
