


Modifies a string by replacing all occurrences of a given character with a specified replacement character
In this question we need to replace the characters of a given string based on the given characters in the character pair array. We will discuss two different solutions. In the first method, we replace each character by iterating over the characters and character pairs of the given string.
In the second method, we will use an array of length 26 to store the replacement characters associated with each character and change the characters of the given string.
Problem Statement − We are given a string str containing N lowercase alphabetic characters. Also, we are given an array containing pairs of characters. We need to replace pairs[i][0] characters in the given string with pairs[i][1].
Example Example
Input – str = "xyz", pairs = {{'x', 'a'}, {'y', 'b'},, {'z', 'c'}}
Output – ‘abc’
illustrate
Here, 'x' is replaced with 'a', 'y' is replaced with 'b', and 'z' is replaced with 'c'.
Input – str = "abderb", pairs = {{'a', 'e'}, {'b', 't'}, {'e', 'f'}, {'r', 's'}}
Output – ‘etdfst’
illustrate
In the string, 'a' is replaced with 'e', 'b' is replaced with 't', 'e' is replaced with 'f', and 'r' is replaced with 's'.
method one
In this method, we will iterate over each pair of characters and replace the matching characters in the given string. We need two nested loops to iterate over the string for each loop.
algorithm
Step 1 - Store the size of the string in variable 'N' and the array in variable 'M'.
Step 2 - Store a copy of the string in the 'temp' variable.
Step 3 - Use a for loop to iterate through the list of pairs.
Step 4 − In the loop, store the first character in variable ‘a’ and the second character in variable ‘b’.
Step 5 - Iterate over the string using nested loops.
Step 6 − In the nested loop, if the current character of the given string is equal to 'a', replace the current character with 'b' in the temporary string.
Step 7 - Return the value of temp.
Example
#include <bits/stdc++.h> using namespace std; string replaceChars(string str, vector<vector<char>> pairs){ // stror the size of the string and the array int N = str.size(), M = pairs.size(); // Create a copy of the string str string temp = str; // Iterate over the array for (int x = 0; x < M; x++){ // store the characters from the pair char a = pairs[x][0], b = pairs[x][1]; // iterate over the string for (int y = 0; y < N; y++){ // If the character is equal to a, then replace it with b if (str[y] == a){ temp[y] = b; } } } return temp; } int main(){ string str = "abderb"; vector<vector<char>> pairs{{'a', 'e'}, {'b', 't'}, {'e', 'f'}, {'r', 's'}}; cout << "The string after replacing with the given characters is - " << replaceChars(str, pairs); return 0; }
Output
The string after replacing with the given characters is - etdfst
Time complexity - O(N*M), where N is the length of the string and M is the length of the character pair array.
Space complexity - O(N), since we store the new string in the temp variable.
Method Two
In this method, we can create an array of size 26. We can then store the replaceable character at the current character's position. Finally, we can take the replaceable elements from the array and update each character of the string.
algorithm
Step 1 - Get string size as 'N' and array size as 'M'.
Step 2 - Define "initial" and "final" arrays of length 26.
Step 3 - Loop through the string and store str[Y] in the initial and final array index of "str[Y] - a". Here, str[Y] - 'a' gives an index between 0 and 25 based on the ASCII value of the character.
Step 4 - Iterate over the given array of character pairs. Within the loop, use nested loops to iterate over the initial array. If the first character of the current pair is equal to the character of the "initial" array, the characters of the "final" array are updated with the second character of the current pair.
Step 5 − Define the ‘result’ variable and initialize it to an empty string.
Step 6 - Iterate through the input string, get the corresponding character of the current character from the "final" array, and append it to the "result" string.
Step 7 - Return the 'result' string.
The reason for storing str[Y] at 'str[Y] - a' position in initial and final array is that if any character is present in the string but not in the character pair, we can Leave it unchanged.
Example
#include <bits/stdc++.h> using namespace std; // Function to replace the characters in the string string replaceChars(string str, vector<vector<char>> pairs){ // getting the size of the string and the vector int N = str.size(), M = pairs.size(); // Declare two arrays of size 26 char initial[26]; char final[26]; // Check all existing characters in the string for (int Y = 0; Y < N; Y++){ initial[str[Y] - 'a'] = str[Y]; final[str[Y] - 'a'] = str[Y]; } // Iterate over the range [0, M] for (int X = 0; X < M; X++){ // get characters from the vector char a = pairs[X][0], b = pairs[X][1]; // Iterate over the range [0, 26] for (int Y = 0; Y < 26; Y++){ // If the character is the same as a, then replace it with b in the final array if (initial[Y] == a){ final[Y] = b; } } } string result = ""; // get the final string using the final array for (int Y = 0; Y < N; Y++){ result += final[str[Y] - 'a']; } return result; } int main(){ string str = "aberb"; vector<vector<char>> pairs{{'a', 'e'}, {'b', 't'}, {'e', 'f'}, {'r', 's'}}; cout << "The string after replacing with the given characters is - " << replaceChars(str, pairs); return 0; }
Output
The string after replacing with the given characters is - etfst
Time complexity - O(N), as nested loop, constant iteration only.
Space complexity - O(1), since it uses an array of length 26, which is constant.
The above is the detailed content of Modifies a string by replacing all occurrences of a given character with a specified replacement character. For more information, please follow other related articles on the PHP Chinese website!

C still dominates performance optimization because its low-level memory management and efficient execution capabilities make it indispensable in game development, financial transaction systems and embedded systems. Specifically, it is manifested as: 1) In game development, C's low-level memory management and efficient execution capabilities make it the preferred language for game engine development; 2) In financial transaction systems, C's performance advantages ensure extremely low latency and high throughput; 3) In embedded systems, C's low-level memory management and efficient execution capabilities make it very popular in resource-constrained environments.

The choice of C XML framework should be based on project requirements. 1) TinyXML is suitable for resource-constrained environments, 2) pugixml is suitable for high-performance requirements, 3) Xerces-C supports complex XMLSchema verification, and performance, ease of use and licenses must be considered when choosing.

C# is suitable for projects that require development efficiency and type safety, while C is suitable for projects that require high performance and hardware control. 1) C# provides garbage collection and LINQ, suitable for enterprise applications and Windows development. 2)C is known for its high performance and underlying control, and is widely used in gaming and system programming.

C code optimization can be achieved through the following strategies: 1. Manually manage memory for optimization use; 2. Write code that complies with compiler optimization rules; 3. Select appropriate algorithms and data structures; 4. Use inline functions to reduce call overhead; 5. Apply template metaprogramming to optimize at compile time; 6. Avoid unnecessary copying, use moving semantics and reference parameters; 7. Use const correctly to help compiler optimization; 8. Select appropriate data structures, such as std::vector.

The volatile keyword in C is used to inform the compiler that the value of the variable may be changed outside of code control and therefore cannot be optimized. 1) It is often used to read variables that may be modified by hardware or interrupt service programs, such as sensor state. 2) Volatile cannot guarantee multi-thread safety, and should use mutex locks or atomic operations. 3) Using volatile may cause performance slight to decrease, but ensure program correctness.

Measuring thread performance in C can use the timing tools, performance analysis tools, and custom timers in the standard library. 1. Use the library to measure execution time. 2. Use gprof for performance analysis. The steps include adding the -pg option during compilation, running the program to generate a gmon.out file, and generating a performance report. 3. Use Valgrind's Callgrind module to perform more detailed analysis. The steps include running the program to generate the callgrind.out file and viewing the results using kcachegrind. 4. Custom timers can flexibly measure the execution time of a specific code segment. These methods help to fully understand thread performance and optimize code.

Using the chrono library in C can allow you to control time and time intervals more accurately. Let's explore the charm of this library. C's chrono library is part of the standard library, which provides a modern way to deal with time and time intervals. For programmers who have suffered from time.h and ctime, chrono is undoubtedly a boon. It not only improves the readability and maintainability of the code, but also provides higher accuracy and flexibility. Let's start with the basics. The chrono library mainly includes the following key components: std::chrono::system_clock: represents the system clock, used to obtain the current time. std::chron

C performs well in real-time operating system (RTOS) programming, providing efficient execution efficiency and precise time management. 1) C Meet the needs of RTOS through direct operation of hardware resources and efficient memory management. 2) Using object-oriented features, C can design a flexible task scheduling system. 3) C supports efficient interrupt processing, but dynamic memory allocation and exception processing must be avoided to ensure real-time. 4) Template programming and inline functions help in performance optimization. 5) In practical applications, C can be used to implement an efficient logging system.


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

SublimeText3 English version
Recommended: Win version, supports code prompts!

ZendStudio 13.5.1 Mac
Powerful PHP integrated development environment

MantisBT
Mantis is an easy-to-deploy web-based defect tracking tool designed to aid in product defect tracking. It requires PHP, MySQL and a web server. Check out our demo and hosting services.

Dreamweaver CS6
Visual web development tools

mPDF
mPDF is a PHP library that can generate PDF files from UTF-8 encoded HTML. The original author, Ian Back, wrote mPDF to output PDF files "on the fly" from his website and handle different languages. It is slower than original scripts like HTML2FPDF and produces larger files when using Unicode fonts, but supports CSS styles etc. and has a lot of enhancements. Supports almost all languages, including RTL (Arabic and Hebrew) and CJK (Chinese, Japanese and Korean). Supports nested block-level elements (such as P, DIV),
