### 题目描述：

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

### 思路：

$dp[i][j] = dp[i + 1][j - 1] \& (s[i] == s[j])$

Runtime：264ms Memory：187.2MB