Leetcode 481. Magical String

Generate the infinite self-referential binary sequence s (starting "122112...") whose run lengths equal the sequence itself, and return how many '1's appear in the first n characters. The core challenge is to simulate this run-length–defined sequence efficiently (linear in n) to count the ones.