Problem Description
Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra...
分类：
其他好文 时间：
2014-08-17 13:04:42
阅读次数：
205
Description
Given a string of 0's and
1's up to
1000000 characters long and indices
i and
j, you are to answer a question whether all characters between position
min(i,j) and position
max(i,j...
分类：
其他好文 时间：
2014-08-10 18:47:30
阅读次数：
277
Determine whether an integer is a palindrome. Do this without extra space.按照palindrome的定义，负数一定不是palindrome number。而且palindrome number肯定是沿着中轴（可能为一个数或者两...
分类：
其他好文 时间：
2014-08-09 18:37:28
阅读次数：
213
For browsers that do not support HTML5, you can use Modernizr. Modernizr is an open-source JavaScript library that can detect whether a browser suppor...
分类：
Web程序 时间：
2014-08-09 13:18:57
阅读次数：
269
题目：Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", r....
分类：
编程语言 时间：
2014-08-07 03:05:38
阅读次数：
291
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = "aabcc", s2 = "dbbca",When s3 = "aadbbcbcac", re...
分类：
其他好文 时间：
2014-08-06 22:44:32
阅读次数：
180
if ( [[[UIDevice currentDevice] systemVersion] floatValue] >= 7.0){ //check whether the permission open for user in settings AVAuthorizationStatus au....
分类：
移动开发 时间：
2014-08-05 13:32:19
阅读次数：
234
The end of otherFor language training our Robots want to learn about suffixes.In this task, you are given a set of words in lower case. Check whether ...
分类：
其他好文 时间：
2014-08-05 10:51:49
阅读次数：
196
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ...
分类：
其他好文 时间：
2014-08-05 00:37:38
阅读次数：
233
A method for garbage collection in a solid state drive (SSD) includes determining whether the SSD is idle by a garbage collection module of the SSD; b...
分类：
其他好文 时间：
2014-08-05 00:25:08
阅读次数：
283
