Longest common suffix: Difference between revisions
Content deleted Content added
→{{header|REXX}}: added a stub for REXX. |
No edit summary |
||
Line 3: | Line 3: | ||
;Task: |
;Task: |
||
The goal is to write a function to find the longest common suffix string amongst an array of strings. |
The goal is to write a function to find the longest common suffix string amongst an array of strings. |
||
=={{header|Julia}}== |
|||
<lang julia>function longestcommonsuffix(strings) |
|||
n, nmax = 0, minimum(length, strings) |
|||
nmax == 0 && return "" |
|||
while n <= nmax && all(s -> s[end-n] == strings[end][end-n], strings) |
|||
n += 1 |
|||
end |
|||
return strings[1][end-n+1:end] |
|||
end |
|||
println(longestcommonsuffix(["baabababc","baabc","bbbabc"])) |
|||
println(longestcommonsuffix(["baabababc","baabc","bbbazc"])) |
|||
println(longestcommonsuffix([""]))</lang>{{out}} |
|||
<pre> |
|||
abc |
|||
c |
|||
</pre> |
|||
=={{header|REXX}}== |
=={{header|REXX}}== |
Revision as of 08:20, 25 July 2020
Longest common suffix is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
- Task
The goal is to write a function to find the longest common suffix string amongst an array of strings.
Julia
<lang julia>function longestcommonsuffix(strings)
n, nmax = 0, minimum(length, strings) nmax == 0 && return "" while n <= nmax && all(s -> s[end-n] == strings[end][end-n], strings) n += 1 end return strings[1][end-n+1:end]
end
println(longestcommonsuffix(["baabababc","baabc","bbbabc"])) println(longestcommonsuffix(["baabababc","baabc","bbbazc"]))
println(longestcommonsuffix([""]))</lang>
- Output:
abc c
REXX
Ring
<lang ring> load "stdlib.ring"
pre = ["baabababc","baabc","bbbabc"] len = len(pre) lenList = list(len) sub = list(len)
see "Input:" + nl see pre
for n = 1 to len
temp = pre[n] pre[n] = rever(temp)
next
for n = 1 to len
lenList[n] = len(pre[n])
next
lenList = sort(lenList) lenMax = lenList[1]
for m = 1 to lenMax
check = 0 sub1 = substr(pre[1],1,m) sub2 = substr(pre[2],1,m) sub3 = substr(pre[3],1,m) if sub1 = sub2 and sub2 = sub3 check = 1 ok if check = 1 longest = m ok
next
longPrefix = substr(pre[1],1,longest) longPrefix = rever(longPrefix)
see "Longest common suffix = " + longPrefix + nl
func rever(cstr)
cStr2 = "" for x = len(cStr) to 1 step -1 cStr2 = cStr2 + cStr[x] next return cStr2
</lang>
- Output:
Input: baabababc baabc bbbabc Longest common suffix = abc