Leetcode Problem 38. Count and Say

38. Count and Say

Leetcode Solutions

Initialize the current string s to '1' (the base case).
For each iteration from 2 to n: a. Initialize an empty string next_s to build the next term. b. Initialize two pointers j and k to 0. j points to the current digit, and k scans ahead to find the first different digit. c. While k is less than the length of s, increment k until a different digit is found. d. Append the count k-j and the digit s[j] to next_s. e. Update j to k to start the next group. f. Update s to next_s for the next iteration.
After all iterations, return the final string s.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen