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-07-09 21:54:26
阅读次数：
200
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2...
分类：
其他好文 时间：
2014-07-08 17:54:12
阅读次数：
297
Determine whether an integer is a palindrome. Do this without extra space.
Some
hints:
Could negative integers be palindromes? (ie, -1)
If you are thinking of converting the integer to string...
分类：
其他好文 时间：
2014-07-05 10:44:29
阅读次数：
227
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
分类：
其他好文 时间：
2014-07-03 19:28:48
阅读次数：
160
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
分类：
其他好文 时间：
2014-07-03 19:20:42
阅读次数：
189
判断一个二叉树是否是轴对称的是一个经典的算法问题，下面结合leetcode上的Symmetric Tree给出判断对称树的两种方法。
先看看问题描述：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, t...
分类：
其他好文 时间：
2014-07-02 06:58:05
阅读次数：
208
userInteractionEnabledA Boolean value that determines whether user events are ignored and removed from the event queue.译：一个布尔值，它决定了是否用户触发的事件被该视图对象忽略和把...
分类：
其他好文 时间：
2014-06-27 17:35:22
阅读次数：
184
Determine whether an integer is a palindrome. Do this without extra space.
分类：
其他好文 时间：
2014-06-27 12:28:06
阅读次数：
228
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", return true.
When ...
分类：
其他好文 时间：
2014-06-26 10:10:19
阅读次数：
214
csapp page124. practice problem 2.35/* Determine whether arguments can be multiplied without overflow */int tmult_ok(int x, int y){ int p = x*y; ...
分类：
其他好文 时间：
2014-06-25 12:47:24
阅读次数：
230
