编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 char[]
的形式给出。
不要给另外的数组分配额外的空间,你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
你可以假设数组中的所有字符都是 ASCII 码表中的可打印字符。
示例 1:
输入:["h","e","l","l","o"] 输出:["o","l","l","e","h"]
示例 2:
输入:["H","a","n","n","a","h"] 输出:["h","a","n","n","a","H"]
思路:首尾交换位置即可,注意O(1)的空间复杂度。
效果如下:
代码如下:
class Solution {
public void reverseString(char[] s) {
int length = s.length;
for(int i = 0,middle =length /2; i< middle; i++){
int tail = length - 1-i;
s[i] = (char)((int)s[i]^(int)s[tail]);
s[tail] = (char)((int)s[tail]^(int)s[i]);
s[i] = (char)((int)s[i]^(int)s[tail]);
}
}
}