LEARNING JOURNAL

class RLEIterator {
    private _arr = []; // Holds the processed RLE data

    // Constructor takes an array of numbers as RLE encoding
    constructor(encoding: number[]) {
        for (let i = 0; i < encoding.length; i += 2) {
            // Skip the pair if the count is 0 (meaning no actual data)
            if (encoding[i] === 0) {
                continue;
            } else {
                // Otherwise, store the count and the actual number in _arr
                this._arr.push({num: encoding[i + 1], count: encoding[i]});
            }
        }
    }

    // Method to get the next n elements based on the RLE data
    next(n: number): number {
        let result = -1; // Default result if no more elements to return
        for (let i = 0; i < this._arr.length; i++) {
            const item = this._arr.shift(); // Get and remove the first element from _arr
            i--;
            n = n - item.count; // Reduce n by the count of the current item
            if (n <= 0) {
                // If n is now 0 or negative, we found the result
                item.count = -1 * n; // Update the count of the current item
                result = item.num; // Set the result to the current number
                if (item.count > 0) {
                    // If there are more of the current number left, add it back to _arr
                    this._arr.unshift(item);
                    i++;
                }
                break; // Exit the loop as we've found the result
            }
        }
        return result; // Return the result (the n-th number or -1 if n exceeds the total counts)
    }
}

/**
 * Your RLEIterator object will be instantiated and called as such:
 * var obj = new RLEIterator(encoding)
 * var param_1 = obj.next(n)
 */