I have an array with list of elements and I need to print maximum count of element which is repeated consecutively. I have written a script for the same, but meanwhile looking for any alternative solution/logic exists for the same.
use strict; use warnings; use Data::Dumper; my @a = ( 2,2,2,3,3,4,4 ); my (%hash, %count); my $prev; foreach ( 0..$#a ) { my $cur = $a[$_]; warn "cur:$cur\n"; if ( ($prev && $cur != $prev || $_ == $#a) ) { my ($prev_key) = keys %count; if ( !$prev_key ||( $count{$prev_key} ) <= $hash{$prev} ) { delete $count{$prev_key} if $prev_key; $count{$prev} = $hash{$prev}; } } $hash{$cur}++; $prev = $cur; } warn Dumper \%count;
Output:
$VAR1 = { '2' => 3 };
The answer should be '3'. Since element '2' has occured consecutively '3' times in the array.

In reply to Print max count of repeated consecutive numbers in an array by vkk05

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.