摘要: 1jvm的垃圾回收http://wenku.baidu.com/link?url=gf08pYxNxVC2ZR607Qv9gn1pkFs5T1Pp5YHxISBEFdcz0D1HdK-7YOuSDftz5nHrqzQ32Dj4UDzEk8TgA6sDGvuqBxhzmielY60NR1cdK7C2h... 阅读全文
posted @ 2014-08-02 17:13 hansongjiang8 阅读(163) 评论(0) 推荐(0) 编辑
摘要: Search for a Range1.最简单的想法,用最普通的二分查找,找到target,然后向左右扩张,大量的重复的target,就会出现O(n)效率。 class Solution { public int[] searchRange(int[] A, int target) { ... 阅读全文
posted @ 2014-08-02 13:37 hansongjiang8 阅读(219) 评论(0) 推荐(0) 编辑