AlertDialod like java awt dialog , when a event actived the activity will display a dialog , it can contain many views not only text or buttons ,here ...
分类：
其他好文 时间：
2014-08-02 15:07:53
阅读次数：
208
Given a set of distinct integers, 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 exa...
分类：
其他好文 时间：
2014-08-01 23:18:42
阅读次数：
246
Description
Background
Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. Th...
分类：
其他好文 时间：
2014-08-01 19:39:52
阅读次数：
207
Problem Description:
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbe...
分类：
其他好文 时间：
2014-07-31 20:47:17
阅读次数：
215
【Level Of Detail】 Here's one of the ways to set up an object with differentLODs. At this point the empty object should contain both versions of th...
分类：
其他好文 时间：
2014-07-31 16:03:16
阅读次数：
253
题目：Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending o....
分类：
编程语言 时间：
2014-07-31 09:38:05
阅读次数：
341
Matrix
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1819 Accepted Submission(s): 792
Problem Description
Give you a matrix(only contain...
分类：
其他好文 时间：
2014-07-30 12:21:53
阅读次数：
191
题目：Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBE....
分类：
编程语言 时间：
2014-07-28 14:42:23
阅读次数：
264
蛮常见一道题目。
思路：
1：排序，按顺序遍历两个数之和twoSum，
2： 二分查找 （0 - twoSum)看是否存在
这题最容易错的地方是must not contain duplicate triplets，所以遍历的这时候要用一个数字记录最后一个遍历的数字是，避免重复。
#include
#include
#include
using namespace s...
分类：
其他好文 时间：
2014-07-27 11:26:22
阅读次数：
260
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBA...
