Leetcode5 Longest palindromic Substring

Source: Internet
Author: User

The longest palindrome substring of a string. Palindrome Sub-string is divided into two kinds, one is ABA type, one is ABBA type, so both cases are considered. With a loop, each character in the string is judged as the center, and the oldest string after each loop is recorded. Time Complexity of O (n*n)

A program was previously written to run, but ran out of time in Leetcode. The following is the modification of other people's program, very concise.


Leetcode5 Longest palindromic Substring

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.