Leetcode 604. Design Compressed String Iterator

Implement an iterator over a run-length–encoded string that supports next() and hasNext(); the challenge is to parse counts (possibly multi-digit) and return characters lazily and efficiently without fully decompressing the string.