Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Longest String Matching

by grizzley (Chaplain)
on Apr 08, 2013 at 14:19 UTC ( #1027515=note: print w/ replies, xml ) Need Help??


in reply to Longest String Matching

As you know exactly where you want to match (at the end of string), you can first get length n of a word you are searching for, then using substr function get substring of length n of the word you are searching in and just do eq comparison of two strings:

#!perl -l @array = ('own', 'known', 'owl'); $q = 'unknown'; $longestmatching = ''; $longestn = 0; for $testword(@array) { $n = length($testword); next if $n <= $longestn; $substr = substr($q, length($q)-$n, $n); if($testword eq $substr) { $longestmatching = $testword; $longestn = $n; } } print $longestmatching;
Additionally you can do sort of @array from longest to shortest string as others mentioned.


Comment on Re: Longest String Matching
Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1027515]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (10)
As of 2015-07-07 06:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (87 votes), past polls