How to find the longest reply substring by leetcode

This article mainly shows you "leetcode how to find the longest text substring", the content is easy to understand, clear, hope to help you solve your doubts, the following let the editor lead you to study and learn "leetcode how to find the longest text substring" this article.

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

Example 1:

Enter: "babad"

Output: "bab"

Note: "aba" is also a valid answer.

Example 2:

Enter: "cbbd"

Output: "bb"

Ideas for solving the problem:

If s [I + 1:j-1] is a palindromic substring, extend one letter to both sides at the same time. If the letters are the same, yes, otherwise no, the subproblem is split.

If s [I] = = s [j] & & s [I + 1:j-1] = true

S [i j] = true

Else

S [i j] = fale

Record s [ipurj] = true or false with a [I] [j]

Boundary conditions:

1, a single letter is

A [I] [I] = true

2, two identical letters are, otherwise they are not

A [I] [iTun1] = a [I] = a [I + 1]

Cycle condition

I