摘要:
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa... 阅读全文
posted @ 2014-05-16 17:52
SunshineAtNoon
阅读(236)
评论(0)
推荐(0)
摘要:
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2014-05-16 16:21
SunshineAtNoon
阅读(277)
评论(0)
推荐(0)
摘要:
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-05-16 11:07
SunshineAtNoon
阅读(200)
评论(0)
推荐(0)

浙公网安备 33010602011771号