Package g1801_1900.s1894_find_the_student_that_will_replace_the_chalk

Class Solution

java.lang.Object

g1801_1900.s1894_find_the_student_that_will_replace_the_chalk.Solution

public class Solution
extends Object

1894 - Find the Student that Will Replace the Chalk.<p>Medium</p> <p>There are <code>n</code> students in a class numbered from <code>0</code> to <code>n - 1</code>. The teacher will give each student a problem starting with the student number <code>0</code>, then the student number <code>1</code>, and so on until the teacher reaches the student number <code>n - 1</code>. After that, the teacher will restart the process, starting with the student number <code>0</code> again.</p> <p>You are given a <strong>0-indexed</strong> integer array <code>chalk</code> and an integer <code>k</code>. There are initially <code>k</code> pieces of chalk. When the student number <code>i</code> is given a problem to solve, they will use <code>chalk[i]</code> pieces of chalk to solve that problem. However, if the current number of chalk pieces is <strong>strictly less</strong> than <code>chalk[i]</code>, then the student number <code>i</code> will be asked to <strong>replace</strong> the chalk.</p> <p>Return <em>the <strong>index</strong> of the student that will <strong>replace</strong> the chalk</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> chalk = [5,1,5], k = 22</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> The students go in turns as follows:</p> <ul> <li> <p>Student number 0 uses 5 chalk, so k = 17.</p> </li> <li> <p>Student number 1 uses 1 chalk, so k = 16.</p> </li> <li> <p>Student number 2 uses 5 chalk, so k = 11.</p> </li> <li> <p>Student number 0 uses 5 chalk, so k = 6.</p> </li> <li> <p>Student number 1 uses 1 chalk, so k = 5.</p> </li> <li> <p>Student number 2 uses 5 chalk, so k = 0.</p> </li> </ul> <p>Student number 0 does not have enough chalk, so they will have to replace it.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> chalk = [3,4,1,2], k = 25</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> The students go in turns as follows:</p> <ul> <li> <p>Student number 0 uses 3 chalk so k = 22.</p> </li> <li> <p>Student number 1 uses 4 chalk so k = 18.</p> </li> <li> <p>Student number 2 uses 1 chalk so k = 17.</p> </li> <li> <p>Student number 3 uses 2 chalk so k = 15.</p> </li> <li> <p>Student number 0 uses 3 chalk so k = 12.</p> </li> <li> <p>Student number 1 uses 4 chalk so k = 8.</p> </li> <li> <p>Student number 2 uses 1 chalk so k = 7.</p> </li> <li> <p>Student number 3 uses 2 chalk so k = 5.</p> </li> <li> <p>Student number 0 uses 3 chalk so k = 2.</p> </li> </ul> <p>Student number 1 does not have enough chalk, so they will have to replace it.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>chalk.length == n</code></li> <li><code>1 <= n <= 10⁵</code></li> <li><code>1 <= chalk[i] <= 10⁵</code></li> <li><code>1 <= k <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	chalkReplacer(int[] chalk, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

chalkReplacer

public int chalkReplacer(int[] chalk,
 int k)