1.Problem DescriptionGiven a sequence
a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a
sub-sequence. For example, given (6,-1,5,4,-...
分类：
其他好文 时间：
2014-06-02 17:36:53
阅读次数：
234
1、编写native方法（java2c）和非native方法（c2java）:package
com.example.provider;public class CallbackJava { // C调用java空方法 public void
helloFromJava() { ...
分类：
移动开发 时间：
2014-06-02 16:42:34
阅读次数：
413
【题目】
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?
For example,
Given n = 3, there are a total of 5 unique BST's.
1 3 3 2 1
\ / / / \ 3 2 1 ...
分类：
其他好文 时间：
2014-06-01 15:34:24
阅读次数：
231
【题目】
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
For example,
Given n = 3, your program should return all 5 unique BST's shown below.
1 3 3 2 1
\ / / / \ ...
分类：
其他好文 时间：
2014-06-01 15:33:45
阅读次数：
297
【题目】
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.
【题意】
...
分类：
其他好文 时间：
2014-06-01 15:08:34
阅读次数：
237
【题目】
Given a string containing only digits, restore it by returning all possible valid IP address combinations.
For example:
Given "25525511135",
return ["255.255.11.135", "255.255.111.35"]. (Order does not matter)
【题意】
给定一个字符串，恢复并返回所有符合条件的IP串
【思路】...
分类：
其他好文 时间：
2014-06-01 13:01:56
阅读次数：
295
【题目】
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [1,3,2].
Note: Recursive solution is trivial, could you do it iteratively?
confused what "{1,#,2...
分类：
其他好文 时间：
2014-06-01 13:01:23
阅读次数：
279
title:
A Pythagorean triplet is a set of three natural numbers, a
b
c, for which,
a2 + b2 =
c2
For example, 32 + 42 = 9 + 16 = 25 = 52.
There exists exactly one Pythagorean triplet for wh...
分类：
其他好文 时间：
2014-06-01 09:17:53
阅读次数：
251
【题目】
A message containing letters from A-Z is being encoded to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Given an encoded message containing digits, determine the total number of ways to decode it.
For example,
Given encoded ...
分类：
其他好文 时间：
2014-06-01 08:59:37
阅读次数：
258
【题目】
Given a collection of integers that might contain duplicates, S, return all possible subsets.
Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If S = [1,2,2], a solution ...
分类：
其他好文 时间：
2014-06-01 08:51:06
阅读次数：
292
