【LeetCode 344】 反转字符串
编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 s 的形式给出。
不要给另外的数组分配额外的空间,你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
LeetCode 344
示例 1
输入:s = ["h","e","l","l","o"]
输出:["o","l","l","e","h"]
示例 2
输入:s = ["H","a","n","n","a","h"]
输出:["h","a","n","n","a","H"]
题解
双指针,左指针从前往后遍历,右指针从后往前遍历,同时交换两指针指向的值。
通过异或操作完成值得交换,为此将不会引入临时变量。
异或法则:
- 归零律: a ⊕ a = 0 a ⊕ a = 0 a⊕a=0;
- 恒定律: a ⊕ 0 = a a ⊕ 0 = a a⊕0=a;
- 交换律: a ⊕ b = b ⊕ a a ⊕ b = b ⊕ a a⊕b=b⊕a;
- 自反律: a ⊕ b ⊕ a = b a ⊕ b ⊕ a = b a⊕b⊕a=b;
Solution
class Solution {
public void reverseString(char[] s) {
int left = 0;
int right = s.length - 1;
while (left < right) {
s[left] ^= s[right]; // a ^ b
s[right] ^= s[left]; // b ^ a ^ b = a
s[left] ^= s[right]; // b ^ a ^ a = b
left++;
right--;
}
}
}