Leetcode Problem 481. Magical String

481. Magical String

Leetcode Solutions

Initialize the magical string s with [1, 2, 2].
Initialize a pointer i to 2, which points to the current number in s that dictates the count of the next number to be appended.
Use a while loop to generate the string until its length is at least n.
Inside the loop, append to s the next number, which is 3 - s[-1] (flipping between '1' and '2').
The number of times to append is given by s[i].
Increment i by 1 after each append operation.
Once the loop is finished, count the number of '1's in the first n elements of s.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen