Description
Zuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely bored. However, clever Zuosige comes up with a new ga...
分类：
其他好文 时间：
2015-05-10 20:35:40
阅读次数：
215
Description
Zuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely bored. However, clever Zuosige comes up with a new ga...
分类：
其他好文 时间：
2015-05-10 20:35:16
阅读次数：
150
Description
Zuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely bored. However, clever Zuosige comes up with a new ga...
分类：
其他好文 时间：
2015-05-10 20:34:29
阅读次数：
158
1611: Concatenation
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 14 Solved: 4
[Submit][Status][Web
Board]
Description
Zuosige always has bad luck. Recently, he is in hospital because ...
分类：
其他好文 时间：
2015-05-10 20:34:05
阅读次数：
134
Description
Zuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely bored. However, clever Zuosige comes up with a new ga...
分类：
其他好文 时间：
2015-05-10 20:34:04
阅读次数：
128
Description
Zuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely bored. However, clever Zuosige comes up with a new ga...
分类：
其他好文 时间：
2015-05-10 20:33:26
阅读次数：
142
1617: Itself is Itself
Time Limit: 6 Sec Memory Limit: 128 MB
Submit: 21 Solved: 4
[Submit][Status][Web
Board]
Description
Zuosige always has bad luck. Recently, he is in hospital becau...
分类：
其他好文 时间：
2015-05-10 18:58:14
阅读次数：
130
目前Apple推荐的场景转换的方法有以下几个： 一般的跳转方法： presentViewController Discussion In a horizontally compact environment, the presented view is always full screen. In ...
分类：
移动开发 时间：
2015-05-10 12:51:56
阅读次数：
284
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.
get(key) - Get the value (will always be positive) of the key if ...
分类：
系统相关 时间：
2015-05-06 19:46:44
阅读次数：
258
Given an array of size n, find the majority element. The majority element is the element that appears more than ? n/2 ? times.You may assume that the array is non-empty and the majority element always...
分类：
其他好文 时间：
2015-05-06 17:57:42
阅读次数：
159
