344. 反转字符串
描述
编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 s 的形式给出。
不要给另外的数组分配额外的空间,你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
示例 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"]
与实现链表差不多
链接
344. 反转字符串 - 力扣(LeetCode) (leetcode-cn.com)
解法
1 class Solution { 2 public void reverseString(char[] s) { 3 int len = s.length; 4 for (int i = 0, j = len - 1; i < len/2; i++, j--) { 5 // s[i] = s[i] ^ s[j]; 6 // s[j] = s[i] ^ s[j]; 7 // s[i] = s[i] ^ s[j]; 8 // 以上 是针对 整数来说 9 10 char temp = s[i]; 11 s[i] = s[j]; 12 s[j] = temp; 13 } 14 } 15 }