2016年4月6日

5. Longest Palindromic Substring （DP）

摘要： 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 longes 阅读全文

posted @ 2016-04-06 15:43 joannae 阅读(161) 评论(0) 推荐(0) 编辑

4. Median of Two Sorted Arrays (二分法；递归的结束条件）

摘要： There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity sh 阅读全文

posted @ 2016-04-06 06:32 joannae 阅读(291) 评论(0) 推荐(0) 编辑

导航