Question

I need help with java 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. I need help with Class Restroom. /** 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() { . . . } } /** 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()); } } } 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_____"); } }.//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

Please let me know if you have any doubts or you want me to modify the code. And if you find this code useful then don't forget to rate my answer as thumps up. Thank you! :)

public class Restroom
{

    private boolean[] s;

    public Restroom(int ns)
    {
        s = new boolean[ns];
    }

    // Adds an occupant in the middle of the longest sequence of unoccupied places.

    public void addOccupant()
    {
        int lengthOfRun = 0;
        int runStart = 0;
        int maxRun = 0;
        int maxRunStart = 0;
        for (int i = 0; i < s.length + 1; i++)
        {
            if (i == s.length)
            {
                if (lengthOfRun > maxRun)
                {
                    maxRun = lengthOfRun;
                    maxRunStart = runStart;
                }
            } else if (lengthOfRun == 0 && !s[i])
            {
                runStart = i;
                lengthOfRun++;
            } else
            {
                if (!s[i])
                {
                    lengthOfRun++;
                } else
                {
                    if (lengthOfRun > maxRun)
                    {
                        maxRun = lengthOfRun;
                        maxRunStart = runStart;
                    }
                    lengthOfRun = 0;
                }
            }
        }
        s[maxRunStart + maxRun / 2] = true;
    }

    // Gets a string describing the current stall occupation

    public String getStalls()
    {
        String q = "";
        for (boolean a : s)
            q += a ? "X" : "_";
        return q;
    }

}

Restroom [-/IdeaProjects/Restroom] - src/Restroom.java [Restroom] Project ▼ *申'旮卜 σ RestroornTesterjava . G Restroom Java if (Is[i]) 35 36 37 38 39 40 41 42 43 トー.idea out else ▼-src Restroom if (LengthOfRun > maxRun) C RestroomTester maxRun = 1ength0TRun; maxRunStart runStart; External Libraries 45 46 47 48 49 50 57 52 Scratches and Consoles length0fRun = 0; s [maxRunStart + maxRun / 2] true ; // Gets a string describing the current stall occupation Main /Library/Java/Java írt au chines/ dk 9 0 4 dk/Contents/ bi /java avaagent/Applications/Intell幻1DEA. ap /Contents/lib/idea t ar 49193:/Applications/Intellij IDEA. app/Contents/bin -Dr Expected: Expected:XXX Expected: XXXX Expected: X X Xxox Expected: XXxXxX Process finished with exit code 0 Compilation completed successfully in 1s 635ms (a minute ago) 22:1 LF: UTF-8 'b