Leetcode 1894. Find the Student that Will Replace the Chalk

1894. Find the Student that Will Replace the Chalk

例を確認して考えている通り実装

class Solution {
    public int chalkReplacer(int[] chalk, int k) {
        int index = 0;
        while (0 < k - chalk[index]) {
            k -= chalk[index];
            if (index < chalk.length - 1) {
                index++;
            } else {
                index = 0;
            }
        }
        return index;
    }
}