Just another Perl shrine | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
This may be a long winded way of doing it, but what about this?
1.Dump all your arrays in to a hash to get frequency of the letters 2. Rebuild array comparing original array element and hash key, and checking if value is < 1 then that element is undef. Unless I've misunderstood what you want, doesn't that do what you're after?
Revolution. Today, 3 O'Clock. Meet behind the monkey bars. If quizzes are quizzical, what are tests? In reply to Re: Reconciling multiple lists (similar to "merge" in CVS?)
by Popcorn Dave
|
|