Leetcode Problem solving-longest palindromic Substring

Title: Given A string S, find the longest palindromic substring in S. The maximum length of S is assume, and there exists one unique longest palindromic substring.

Problem solving: Refer to the online great God practice, solve the problem as follows:

classSolution:defget_palindromic (self, S, K, L): S_len=Len (s) whileK >= 0 andL < S_len andS[k] = =S[l]: K-= 1L+ = 1returnS[k+1: l]defLongestpalindrome (self, s): L_palindromic="'         forIinchRange (len (s)): Temp_palindromic1=Self.get_palindromic (S, I, i)ifLen (TEMP_PALINDROMIC1) >Len (l_palindromic): L_palindromic=Temp_palindromic1 Temp_palindromic2= Self.get_palindromic (S, I, i+1)            ifLen (TEMP_PALINDROMIC2) >Len (l_palindromic): L_palindromic=Temp_palindromic2returnL_palindromic

Leetcode Problem solving-longest palindromic Substring