Problem Description
There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules:
● ai ∈ [0,n]
● ai ≠ aj( i ≠ j )
For sequence a and sequence b,...
分类：
其他好文 时间：
2014-09-15 01:06:27
阅读次数：
175
Problem Description
There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules:
● ai ∈ [0,n]
● ai ≠ aj( i ≠ j )
For sequence a and sequence b, t...
分类：
其他好文 时间：
2014-09-14 23:41:28
阅读次数：
262
Populating Next Right Pointers in Each Node IGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; Tree...
分类：
其他好文 时间：
2014-09-14 22:04:27
阅读次数：
241
http://acm.hdu.edu.cn/showproblem.php?pid=5012Problem Description There are 2 special dices on the table. On each face of the dice, a distinct number ...
分类：
其他好文 时间：
2014-09-14 20:35:37
阅读次数：
269
传送门Colored SticksTime Limit: 5000MSMemory Limit: 128000KDescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with...
分类：
其他好文 时间：
2014-09-14 20:34:57
阅读次数：
202
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such po...
分类：
其他好文 时间：
2014-09-14 12:41:37
阅读次数：
223
原题地址：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
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.
For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1]...
分类：
移动开发 时间：
2014-09-13 21:34:25
阅读次数：
219
http://poj.org/problem?id=1860DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two p...
分类：
其他好文 时间：
2014-09-13 20:08:45
阅读次数：
410
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =...
分类：
其他好文 时间：
2014-09-13 20:05:35
阅读次数：
219
