今天在项目中用到富文本的link问题时，用到了CXAHyperlinkLabel。但是在文本内容是中文时发现会崩溃，最终定位到是在HtmlParser解析时，在_characters里面获取对应的字符串是崩溃的。 NSString?*string?=?[NS...
分类：
其他好文 时间：
2014-08-19 14:45:55
阅读次数：
159
Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the e...
分类：
其他好文 时间：
2014-08-19 14:24:14
阅读次数：
182
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You shoul...
分类：
其他好文 时间：
2014-08-18 21:53:12
阅读次数：
341
leetcode中和括号匹配相关的问题共有三个，分别是：
Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
determine if the input string is valid.
The brackets m...
分类：
其他好文 时间：
2014-08-18 20:35:52
阅读次数：
221
Wildcard Matching
Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequen...
分类：
其他好文 时间：
2014-08-18 18:34:13
阅读次数：
214
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strin...
分类：
其他好文 时间：
2014-08-18 17:46:52
阅读次数：
244
Idiomatic Phrases Game
Time Limit: 2 Seconds Memory Limit: 65536 KB
Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain ...
分类：
其他好文 时间：
2014-08-18 16:22:52
阅读次数：
228
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
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 = "ADOBECOD...
Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe...
分类：
其他好文 时间：
2014-08-16 13:42:40
阅读次数：
200
