Question

need help answering this with java

Write and test a class that contains an array as an attribute.

We want to analyze a series of random coin flips represented by an array of integers, 0 for heads, 1 for tails. Specifically we want to identify a "run", which is a consecutive sequence of the same result for the coin flip. Write a FlipStats class with the following methods:

Design (what are attributes and methods needed, constants, static attributes/methods), code, and test your FlipStats class. See the test program (with method names expected)

import java.util.Random;
public class FlipStatsTest {
  public static void main( String [] args ) {
          int [] flips= new int[100];
          Random rand = new Random();
          for (int i=0; i<flips.length; i++){
                  flips[i]=rand.nextInt(2);
                  System.out.print(flips[i]+" ");
          }
          System.out.println();
          FlipStats analyzer = new FlipStats(flips);
          System.out.println(analyzer.firstRun(0,3));
          System.out.println(analyzer.firstRun(1,5));
  }
}

Sample Output:
1 1 1 0 0 1 1 0 1 0 0 0 1 1 1 1 1 0 0 1 1 1 1 1 1 1 0 0 1 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 1 0 0 0 1 1 1 0 0 1 0 0 0 0 1 1 0 1 1 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 0 0 0
9
12

• A non-default constructor that performs a deep copy from its single argument, an array of integers,
• A "firstRun" method that takes 2 arguments, an integer denoting what side we are looking for, and an integer denoting what exact length run of that side we are looking for. The method should return the index position that the first run of that exact length starts, or return -1 if not found.

Answer 1

Note: I am provided FlipStats.java program only because not modification done in the "FlipStatsTest .java" program.

Explanation : If you want to find the string with exact length with next flip is same or not , it returns that index

For example:

flip array = 1100001111001

firstRun(0,3) = 2

firstRun(1,3) = 7

Screenshot of the program:

Sample output:

0 1 0 0 1 1 1 1 1 0 0 1 0 1 0 0 0 0 0 1 0 1 0 0 1 1 0 1 0 1 1 0 1 1 1 0 0 0 1 0 0 0 1 0 0 1 1 1 0 0 1 1 0 1 1 0 0 1 1 1 1 0 0 1 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 1 1 1 1 0 1 1 0 0 1 0 1 1 0 1 0 1 0 0 0 1

14

4

Code to copy:

public class FlipStats
{
//0 for heads, 1 for tails.
int[] flips;
int size;
/*A non-default constructor */
public FlipStats(int[] flips)
{//deep copy of the flips
  this.flips = flips;
  size = flips.length;
}
/*"firstRun" method that takes 2 arguments,
* an integer denoting what side of the coin,
* and an integer denoting what exact length
*/
public int firstRun(int flip, int n)
{
  //check entire flips array to find flip with length n
  for(int i=0;i<size-n;i++)
  {
   boolean found = true;
   for(int j=i,k=0;k<n;j++,k++)
   {
    //check string of length is existing or not
    if(flip != flips[j])
    {     
     found = false;
     break;
    }
   }
   //if found is true than return index i
   if(found == true)
    return i;
  }
  //if not found string return false
  return -1;
}

}

Note: Provided answer as per the question above.But if you want to find the string with exact length than replace this below method "firstRun()" in the "FlipStats.java" program.

For example:

1) flip array = 11000011001

firstRun(0,3) = -1, //here heads of length 3 is not found than return -1,

2) flip array = 110000110001

firstRun(0,3) = 8,//here heads of length 3 is found at 8th location than return 8.

Screenshot of the Method: