在java中extends用于继承父类，只要父类不是声明为final或者为abstract类就可以，但是java不支持多重继承。可以使用接口实现多重继承implements，继承只能继承一个类，但implements可以实现多个接口，用逗号分开就行了比如class A extends B imple...
分类：
编程语言 时间：
2014-07-09 21:11:46
阅读次数：
290
Handle onClick for our custom LinearLayout for Gallery-like HorizontalScrollViewThe post "Implement Gallery-like HorizontalScrollView" and "Implement ...
分类：
其他好文 时间：
2014-07-07 12:30:02
阅读次数：
282
题目：Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not poss...
分类：
其他好文 时间：
2014-07-07 10:57:23
阅读次数：
175
Since I mainly use Java, this problem seems meaning less for me to implement it with Java. Just use StringBuilder to append each character in string f...
分类：
其他好文 时间：
2014-07-06 13:33:34
阅读次数：
296
字符串题目就先告一段落了，又是在看balabala不知道在说些什么的英语。算法也很简单，用了几个库函数就搞定了。本来还担心题里说的replace-by为空的特殊情况需要特殊处理，后来发现按一般情况处理也能A过去。第一次RE是因为char t[]开小了。对了，strstr()函数我也是第一次用，对这个...
分类：
其他好文 时间：
2014-07-01 19:17:14
阅读次数：
224
This post introduce how to implement the public or private static members in JavaScript.
分类：
编程语言 时间：
2014-07-01 12:10:42
阅读次数：
190
题目
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it witho...
分类：
其他好文 时间：
2014-07-01 06:24:42
阅读次数：
204
题目
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it...
分类：
其他好文 时间：
2014-07-01 06:23:24
阅读次数：
334
题目
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it witho...
分类：
其他好文 时间：
2014-06-30 19:38:37
阅读次数：
226
题目
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it...
分类：
其他好文 时间：
2014-06-30 19:23:18
阅读次数：
200
