Reverse String in chunks
Asked 1 year ago
0Comments
0 Views
The problem "Reverse String II" asks us to perform a specific string manipulation:
- We're given a string
sand an integerk. - We need to reverse the first
kcharacters of every2kchunk of the string. - If there are fewer than
kcharacters left at the end, we reverse all of them. - If there are between
kand2kcharacters left, we reverse only the firstk.
What We Need to Find: We need to return the modified string after applying these reversal rules.
Approach and Intuition:
- Iterate through the string in chunks of
2kcharacters. - For each chunk, reverse the first
kcharacters. - Handle edge cases at the end of the string.
Let's break down the code into more understandable blocks:
class Solution {
public:
string reverseStr(string s, int k) {
int stringLength = s.length();
for (int start = 0; start < stringLength; start += 2*k) {
// Determine the end point for reversal
int end = min(start + k, stringLength);
// Reverse the substring from start to end
reverse(s.begin() + start, s.begin() + end);
}
return s;
}
};The beauty of this solution is that it automatically handles all the edge cases mentioned in the problem statement:
- If there are fewer than
kcharacters left, it will reverse all of them. - If there are between
kand2kcharacters left, it will only reverse the firstk.
This approach is efficient because it modifies the string in-place, avoiding unnecessary memory allocation
Using While LOOP !
class Solution {
public:
string reverseStr(string s, int k) {
int left = 0; // starting index of the window
int right = min(k, (int)s.length()); // ending index of the window
while (left < s.length()) {
// Reverse the substring between left and right
reverse(s.begin() + left, s.begin() + right);
// Move the window 2k steps forward
left += 2 * k;
right = min(left + k, (int)s.length());
}
return s;
}
};JAVA CODE :
public class Solution {
public String reverseStr(String s, int k) {
int left = 0;
int right = Math.min(k, s.length());
StringBuilder sb = new StringBuilder(s);
while (left < s.length()) {
StringBuilder temp = new StringBuilder(sb.substring(left, right));
sb.replace(left, right, temp.reverse().toString());
left += 2 * k;
right = Math.min(left + k, s.length());
}
return sb.toString();
}
}Share