Leetcode Problem 1180. Count Substrings with Only One Distinct Letter

1180. Count Substrings with Only One Distinct Letter

Leetcode Solutions

Initialize total to 0 to count the number of substrings.
Initialize two pointers left and right to 0. These pointers define the boundaries of the current segment with one distinct letter.
Iterate through the string s using the right pointer.
If right has not reached the end of the string and s[right] is the same as s[left], increment right to extend the current segment.
If s[right] is different from s[left], calculate the length of the current segment as right - left, apply the arithmetic sequence sum formula to get the number of substrings for this segment, and add it to total.
Set left to the current right position to start a new segment.
Repeat steps 4-6 until right reaches the end of the string.
After the loop, ensure to add the substrings count for the last segment.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen