Longest palindromic substrings: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) m (→{{header|Raku}}: Don't bother check to see if a character is equal to itself. Pro tip: it is.) |
m (→Phix: as per recent Raku mod, skip the s[i]=s[i] test) |
||
Line 385: | Line 385: | ||
sequence res = {} |
sequence res = {} |
||
for i=1 to length(s) do |
for i=1 to length(s) do |
||
for j=0 to iff(i>1 and s[i-1]=s[i]? |
for j=0 to iff(i>1 and s[i-1]=s[i]?2:1) do |
||
integer rev = j, |
integer rev = j, |
||
fwd = |
fwd = 1 |
||
while rev<i and i+fwd<=length(s) and s[i-rev]=s[i+fwd] do |
while rev<i and i+fwd<=length(s) and s[i-rev]=s[i+fwd] do |
||
rev += 1 |
rev += 1 |