Anonymous user
Longest palindromic substrings: Difference between revisions
m
→{{header|REXX}}: fixed two typos.
m (→{{header|REXX}}: moved a statement.) |
m (→{{header|REXX}}: fixed two typos.) |
||
Line 667:
m= 0
do LL=2 for L-1 /*start with palindromes of length two.*/
if find(1) then m= max(m,LL) /*Found a
end /*LL*/
LL= max(1,m)
Line 679:
exit 0 /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
find: parse arg short /*if SHORT==1, only find 1
@= /*initialize palindrome list to a null.*/
do j=1 for L-LL+1 /*obtain length of possible palindromes*/
| |||