


Count the number of substrings consisting of a single distinct character
In this article, we will discuss the problem of counting the number of substrings consisting of single distinct characters in a given string. We will explore an efficient algorithm to solve this problem and provide C code to implement it.
Problem Statement
Given a string S, the task is to count the number of substrings composed of single distinct characters.
For example, if the input string is "aaaaa", the output should be 15 because there are 15 substrings consisting of single distinct characters. The substrings are "a", "a", "a", "a", "a", "a", "a", "a", "a", "a", "a", "aaa ”, “aaa”, “aaaa”, “aaaa”, “aaaa”.
algorithm
We can solve this problem with linear time complexity. We can iterate over the input string and keep track of the current character and the length of the current substring. Whenever a new character is encountered or the end of the string is reached, we can count the number of substrings that can be formed by the current character and the length of the current substring.
Here is a step-by-step algorithm to solve this problem -
Initialize count and len to 1.
Iterate over string S from index 1 to n-1.
If the current character is the same as the previous character, len is increased by 1.
If the current character is different from the previous character, add (len*(len 1))/2 to count and reset len to 1.
Return the count.
Let us take the string "aaaaa" as an example to understand the algorithm -
Initialize count and len to 1.
Iterate string from index 1 to n-1:
At index 1, the current character is the same as the previous character, so len is increased by 1.
At index 2, the current character is the same as the previous character, so len is increased by 1.
At index 3, the current character is the same as the previous character, so len is increased by 1.
At index 4, the current character is the same as the previous character, so len is increased by 1.
We have reached the end of the string, so add (len*(len 1))/2 to count. count = count (5*(5 1))/2 = 15.
Return the count.
C implementation
This is the C code that implements the above algorithm -
Example
#include<bits/stdc++.h> using namespace std; int countSubstrings(string S) { int n = S.length(); int count = 1, len = 1; for (int i = 1; i < n; i++) { if (S[i] == S[i-1]) { len++; } else { count += (len*(len+1))/2; len = 1; } } count += (len*(len+1))/2; return count-1; } int main() { string S = "aaaaa"; int count = countSubstrings(S); cout << count << endl; return 0; }
Output
15
in conclusion
In this article, we discussed the problem of counting the number of substrings consisting of single distinct characters in a given string. We provide an efficient algorithm to solve this problem in linear time complexity and implement it in C. This problem can also be solved using other techniques, but the algorithm above provides
The above is the detailed content of Count the number of substrings consisting of a single distinct character. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.

C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.

The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.

C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.

Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i
