Day 4 - Print in Order - Leetcode Problem Solved

Day 4 - Print in Order - Leetcode Problem Solved

#I4G10DaysOfCodeChallenge - Day 4

The Task

Suppose we have a class:

public class Foo {
  public void first() { print("first"); }
  public void second() { print("second"); }
  public void third() { print("third"); }
}

The same instance of Foo will be passed to three different threads. Thread A will call first(), thread B will call second(), and thread C will call third(). Design a mechanism and modify the program to ensure that second() is executed after first(), and third() is executed after second().

Note:

We do not know how the threads will be scheduled in the operating system, even though the numbers in the input seem to imply the ordering. The input format you see is mainly to ensure our tests' comprehensiveness.

Example 1:

Input: nums = [1,2,3]
Output: "firstsecondthird"
Explanation: There are three threads being fired asynchronously. The input [1,2,3] means thread A calls first(), thread B calls second(), and thread C calls third(). "firstsecondthird" is the correct output.

Example 2:

Input: nums = [1,3,2]
Output: "firstsecondthird"
Explanation: The input [1,3,2] means thread A calls first(), thread B calls third(), and thread C calls second(). "firstsecondthird" is the correct output.

Constraints:

nums is a permutation of [1, 2, 3].

Thought Process

Since the threads have to be called accordingly, I decided to create a boolean flag for the first and second thread.

This way, when the respective threads are called, their boolean flags are assigned True. Only when a preceding thread is True, will the next thread print its statement. This was done using a while loop using the preceding thread's flag as a condition.