github:https://github.com/xiaozhengwei/Algorithms-And-DataStructure
class Solution {
public void reverseString(char[] s) {
int length = s.length;
if (length <= 1) {
return;
}
for (int start = 0,end = s.length - 1; start < end; start++, end--) {
char c = s[end];
s[end] = s[start];
s[start] = c;
}
}
}