本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss
摘要: 题目链接Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique lo... 阅读全文
posted @ 2014-04-19 23:56 tenos 阅读(18955) 评论(3) 推荐(2) 编辑
摘要: 题目链接There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should... 阅读全文
posted @ 2014-04-19 16:18 tenos 阅读(2360) 评论(0) 推荐(0) 编辑

本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss

公益页面-寻找遗失儿童