833. Find And Replace in String
Explanation:
To solve this problem, we will iterate through each replacement operation and update the string accordingly. We will check if the source string exists at the specified index in the original string. If it does, we will replace the source string with the target string.
Algorithm:
- Iterate through each replacement operation.
- For each operation, check if the source string exists at the specified index in the original string.
- If the source string exists, replace it with the target string.
- Return the final modified string after all replacement operations.
Time Complexity:
The time complexity of this approach is O(nmk), where n is the length of the input string, m is the maximum length of source or target strings, and k is the number of replacement operations.
Space Complexity:
The space complexity of this approach is O(n), where n is the length of the input string.
:
class Solution {
public String findReplaceString(String s, int[] indices, String[] sources, String[] targets) {
StringBuilder sb = new StringBuilder(s);
for (int i = 0; i < indices.length; i++) {
int index = indices[i];
String source = sources[i];
String target = targets[i];
if (s.substring(index, index + source.length()).equals(source)) {
sb.replace(index, index + source.length(), target);
}
}
return sb.toString();
}
}Code Editor (Testing phase)
Improve Your Solution
Use the editor below to refine the provided solution. Select a programming language and try the following:
- Add import statement if required.
- Optimize the code for better time or space complexity.
- Add test cases to validate edge cases and common scenarios.
- Handle error conditions or invalid inputs gracefully.
- Experiment with alternative approaches to deepen your understanding.
Click "Run Code" to execute your solution and view the output. If errors occur, check the line numbers and debug accordingly. Resize the editor by dragging its bottom edge.