344. Reverse String
Input: ["h","e","l","l","o"]
Output: ["o","l","l","e","h"]Input: ["H","a","n","n","a","h"]
Output: ["h","a","n","n","a","H"]// Iteration
void reverseString(vector<char>& s) { // time: O(n); space: O(1)
int left = 0, right = s.size() - 1;
while (left < right) {
char t = s[left];
s[left++] = s[right];
s[right--] = t;
}
}void helper(vector<char>& s, int start, int end) {
if (start >= end) return;
swap(s[start], s[end]);
helper(s, start + 1, end - 1);
}
void reverseString(vector<char>& s) {
helper(s, 0, s.size() - 1);
}Previous340. Longest Substring with At Most K Distinct CharactersNext345. Reverse Vowels of a String
Last updated