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

Re: Getting the intersection of n collections.

by dtr (Scribe)
on Oct 11, 2006 at 11:59 UTC ( [id://577591]=note: print w/replies, xml ) Need Help??


in reply to Getting the intersection of n collections.

Assuming that each number can only appear once in each list, then the following should work:-

my %counts = ();
foreach my $val (@d1, @d2, @d3) {
    $counts{$val}++;
}
return grep { $counts{$_} == 3 } sort keys %counts;

[download]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://577591]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2024-04-23 19:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found