ArrayLongest

ArrayLongest - // holds longest sequence so far int count =...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
public class ArrayLongest { public static void main (String [] arg) { int[] numArray = {3,5,6,8,3,0,0,4,4,4,2,3,3,3,3,3,9,9,9}; int longest = longSequence(numArray); System.out.println("The number that appears the most frequent is " + longest); l } public static int longSequence(int[] v) { int seqIndex = 0; // holds index of number in seq int longSeq= 1;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: // holds longest sequence so far int count = 1; // current sequence length for ( int k = 1; k < v.length; k++ ) { if ( v[k] == v[k-1] ) { count++; //current seq length //System.out.println("count is " + count); if ( count > longSeq ) { longSeq = count; seqIndex = k; } } else count = 1; c } return v[seqIndex]; // ANSWER } }...
View Full Document

This note was uploaded on 06/07/2010 for the course CS 201 taught by Professor Staff during the Spring '08 term at Iona.

Ask a homework question - tutors are online