Pages

Friday, 20 January 2017

Chapter 22 Exercise 5, Introduction to Java Programming, Tenth Edition Y. Daniel LiangY.

22.5 (Same-number subsequence) Write an O(n) program that prompts the user to enter a sequence of integers ending with 0 and finds the longest subsequence
with the same number.

import java.util.Scanner;

public class ProgrammingEx22_5 {
 public static void main(String[] args) {
  Scanner input = new Scanner(System.in);
  System.out.print("Enter a series of numbers ending with 0:");

  int longestSequenceCount = 0;
  int longestSequenceValue = 0;
  int longestSequenceIndex = 0;

  int currentLongestSequenceCount = 1;
  int currentLongestSequenceValue = 0;

  int value;
  int index = 0;
  int previous = 0;
  do {
   value = input.nextInt();

   if (value == previous)
    currentLongestSequenceCount++;
   else if (currentLongestSequenceCount > longestSequenceCount) {
    longestSequenceCount = currentLongestSequenceCount;
    longestSequenceValue = currentLongestSequenceValue;
    longestSequenceIndex = index - currentLongestSequenceCount;

    currentLongestSequenceCount = 1;
    currentLongestSequenceValue = value;
   }

   previous = value;
   index++;
  }
  while (value != 0);

  System.out.println("The longest same number sequence starts at index " + longestSequenceIndex + " with " + longestSequenceCount + " values of " + longestSequenceValue);
 }
}

No comments :

Post a Comment