class Solution {
public void reverseString(char[] s) {
int front = 0;
int rear = s.length - 1;
char temp ;
if (s.length % 2 != 0) {
while (front!=rear){
temp = s[front];
s[front] = s[rear];
s[rear] = temp;
front++;
rear--;
}
}
else {
while ((front-1)!=rear){
temp = s[front];
s[front] = s[rear];
s[rear] = temp;
front++;
rear--;
}
}
}
}