Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: weird array processing question

by Fletch (Chancellor)
on May 05, 2011 at 20:53 UTC ( #903240=note: print w/replies, xml ) Need Help??

in reply to weird array processing question

It almost sounds like you want something like this (warning: destructive to the array since it removes items off the beginning because they've already been compared):

my @array = ( 1, 2, 3, 4, 1, 2, 3 ); my $matches = 0; while( @array ) { my $candidate = shift @array; for( @array ) { $matches++ if $candidate == $_ } } print "Got $matches matches\n";

Update: I like toolic's approach below better as it solves the problem "does my list have more than three duplicates of any one element" without as many comparisons; original question was fuzzy so . . .

The cake is a lie.
The cake is a lie.
The cake is a lie.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://903240]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2018-02-25 13:47 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (312 votes). Check out past polls.