5.?Longest Palindromic Substring
Given a string?s, find the longest palindromic substring in?s. You may assume that the maximum length of?s?is 1000
問題描述
就是給你一個(gè)字符串,找出最長(zhǎng)的回文子字符串。
解法1:
就是循環(huán)遍歷,一個(gè)個(gè)比對(duì),但是這個(gè)解法時(shí)間肯定最慢,時(shí)間復(fù)雜度要O(n^3)
解法2: