Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: Re: Finding largest common subset in lists?

by Aragorn (Curate)
on Jun 05, 2003 at 10:21 UTC ( [id://263273]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
       push @tmp, $a[$_]
          if ( $a[$_ + 1]) eq ( $b[$map{$a[$_]} + 1] )
             or @tmp >= 1;
    
  2. or download this
        push @tmp, $a[$_]
          if ($a[$_ + 1] and $b[$map{$a[$_]} + 1]
              and ( $a[$_ + 1]) eq ( $b[$map{$a[$_]} + 1] )
              or @tmp >= 1);
    

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2024-04-24 07:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found