解法一:遍历

遍历前半部分,与后半部分对应位置交换。

  1. class Solution {
  2. public void reverseString(char[] s) {
  3. final int len = s.length;
  4. char temp;
  5. for (int i = 0; i < len / 2; ++i) {
  6. temp = s[i];
  7. s[i] = s[len - i - 1];
  8. s[len - i - 1] = temp;
  9. }
  10. }
  11. }