StringTools[MaximalPalindromicSubstring] - find a maximal palindromic substring of a string
|
Calling Sequence
|
|
MaximalPalindromicSubstring( s )
|
|
Parameters
|
|
s
|
-
|
string; any Maple string
|
|
|
|
|
Description
|
|
•
|
The MaximalPalindromicSubstring command computes a maximal palindromic substring of the string s. A string is a palindrome if it is equal to itself reversed, that is, .
|
•
|
If s is nonempty and contains no substrings that are palindromes, the first character of s is the maximal palindromic substring. If s is empty, the empty string ("") is the maximal palindromic substring.
|
•
|
The maximal palindromic substring of s is indicated by returning a sequence of two non-negative integers:
|
|
The first is the index of the beginning of the palindromic substring in the string s.
|
|
The second is the length of the palindromic substring.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
|
|
Download Help Document
Was this information helpful?