Write a function that reverses a string. The input string is given as an array of characters s
.
You must do this by modifying the input array in-place with O(1)
extra memory.
Example 1:
Input: s = ["h","e","l","l","o"] Output: ["o","l","l","e","h"]
Example 2:
Input: s = ["H","a","n","n","a","h"] Output: ["h","a","n","n","a","H"]
Constraints:
1 <= s.length <= 105
s[i]
is a printable ascii character.
class Solution {
public void reverseString(char[] s) {
reverseHelp(s,0,s.length-1);
}
private void reverseHelp(char[] s, int i,int j)
{
if(i>=j)
{
return;
}
char t=s[i];
s[i]=s[j];
s[j]=t;
reverseHelp(s,i+1,j-1);
}
}