Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re^2: Challenge: Fast Common Substrings

by eric256 (Parson)
on Apr 06, 2007 at 20:07 UTC ( #608744=note: print w/ replies, xml ) Need Help??

in reply to Re: Challenge: Fast Common Substrings
in thread Challenge: Fast Common Substrings


I misread the definition of substring to mean all substrings of that length or lower...quick easy fix and it starts placing decent.

sub common_sub { my ($s1,$s2,$len) = @_; my $len_s1 = length($s1); my $len_s2 = length($s2); my $match_s1 = {}; my $match_s2 = {}; for my $start (0..length($s1)-1) { #for my $l (1..$len) { next if $start+$len > $len_s1; $match_s1->{substr($s1, $start, $len)} ||= 1; #} } for my $start (0..length($s2)-1) { #for my $l (1..$len) { next if $start+$len > $len_s2; $match_s2->{substr($s2, $start, $len)} ||= 1; #} } $match_s1->{$_}++ for keys %$match_s2; return grep { $match_s1->{$_} == 2 } keys %$match_s1; }

Eric Hodges

Comment on Re^2: Challenge: Fast Common Substrings
Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (9)
As of 2015-12-01 11:03 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (798 votes), past polls