摘要:
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Example 2: Analysis: 想到 阅读全文
posted @ 2014-06-17 12:07
neverlandly
阅读(594)
评论(0)
推荐(0)
摘要:
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then le... 阅读全文
posted @ 2014-06-17 04:58
neverlandly
阅读(504)
评论(0)
推荐(0)
浙公网安备 33010602011771号