Question

JAVA PROGRAMMING

It is a well-researched fact that men in a restroom generally prefer to maximize their distance from already occupied stalls, by occupying the middle of the longest sequence of unoccupied places.
For example, consider the situation where ten stalls are empty. _ _ _ _ _ _ _ _ _ _   
The first visitor will occupy a middle position: _ _ _ _ _ X _ _ _ _  
The next visitor will be in the middle of the empty area at the left. _ _ X _ _ X _ _ _ _  
Write a program that reads the number of the stalls from the user in the RestroomSimulation.java file and then prints out the diagrams in the format given above when the stalls become filled, one at a time. Hint: Use an array of boolean values to indicate whether a stall is occupied. The user should enter a number between 5 and 30 for the number of stalls. The number should be validated to be within that range. The rest of the code will be written in the Restroom.java file.  
There are two other test programs that you can use to test your program included in the zip file. They are the ones call Restroom Tester.java and RestroomTester2.java.

**RESTROOM.JAVA**

/**
A class that shows how restroom stalls are occupied.
*/

public class Restroom
{
. . .

/**
Constructs a restroom with a given number of stalls.
@param ns the number of stalls
*/
public Restroom(int ns)
{
       . . .
}

/*
Adds an occupant in the middle of the longest sequence of
unoccupied places.
*/
public void addOccupant()
{
. . .
}

/*
Gets a string describing the current stall occupation
@return a string with _ for an empty stall and X for an occupied one
*/
public String getStalls()
{
. . .
}
}

**RESTROOMSIMULATION.JAVA**

/**
Print diagrams of restroom stalls as they are occupied.
The premise is that people generally prefer to maximize
their distance from already occupied stalls, by occupying
the middle of the longest sequence of unoccupied places.
*/
public class RestroomSimulation
{
public static void main(String[] args)
{
int STALLS = 10;
Restroom wc = new Restroom(STALLS);

for (int i = 1; i <= STALLS; i++)
{
wc.addOccupant();
System.out.println(wc.getStalls());
}
}
}

**RESTROOMTESTER.JAVA**

public class RestroomTester
{
public static void main(String[] args)
{
int STALLS = 12;
Restroom wc = new Restroom(STALLS);
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: ______X_____");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: ___X__X_____");
}
}

**RESTROOMTESTER2**

//HIDE
public class RestroomTester2
{
public static void main(String[] args)
{
int STALLS = 12;
Restroom wc = new Restroom(STALLS);
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: ______X_____");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: ___X__X_____");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: ___X__X__X__");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: _X_X__X__X__");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: _X_X_XX__X__");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: _X_X_XX_XX__");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: _X_X_XX_XX_X");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: XX_X_XX_XX_X");
wc.addOccupant();
System.out.println(wc.getStalls());
System.out.println("Expected: XXXX_XX_XX_X");
}
}

Answer 1

--------------------------------------------------------------------------------------------------

// Restroom.java file

public class Restroom {
  
   /**
   Constructs a restroom with a given number of stalls.
   @param ns the number of stalls
   */
   boolean occupiedRestrooms[];
   public Restroom(int ns)
   {
       occupiedRestrooms = new boolean[ns];
       for(int i = 0; i < ns; i++) {
           occupiedRestrooms[i] = false;
       }
   }

  
   /*
   Adds an occupant in the middle of the longest sequence of
   unoccupied places.
   */
  
   public void addOccupant()
   {
       //find the longest unoccupied sequence
       int longestSeqCount = 0;
       int longestSeqIndex = -1;
       int currentSeqCount = 0;
       int n = occupiedRestrooms.length;
       for(int i = 0; i < n ; i++) {
           if(occupiedRestrooms[i] == true) {
               if(longestSeqCount < currentSeqCount) {
                   longestSeqCount = currentSeqCount;
                   longestSeqIndex = i - currentSeqCount;
               }
               currentSeqCount = 0;
              
           }else {
               currentSeqCount += 1;
           }
       }
      
       if(longestSeqCount < currentSeqCount) {
           longestSeqCount = currentSeqCount;
           longestSeqIndex = n - currentSeqCount;
       }
      
      
       //Set the middle of the longest Unoccupied sequence to True
      
           occupiedRestrooms[longestSeqIndex + (longestSeqCount/2)] = true;
      
   }

   /*
   Gets a string describing the current stall occupation
   @return a string with _ for an empty stall and X for an occupied one
   */
   public String getStalls()
   {
       String stall = "";
       int n = occupiedRestrooms.length;
       for(int i = 0;i<n;i++) {
           if(occupiedRestrooms[i] == true) {
               stall = stall.concat("X ");
           }else {
              
               stall = stall.concat("_ ");
              
           }
       }
       return stall;
   }
}

--------------------------------------------------------------------------------------------------

// Screenshot for n= 12 stalls where 12 occupants are added one by one

// We basically set STALLS = 12 in RESTROOMSIMULATION.JAVA file and then run that  file

-X-X_X_x xx X_XX_XX_X

--------------------------------------------------------------------------------------------------