0344-Easy-反转字符串
题目
输入:["h","e","l","l","o"]
输出:["o","l","l","e","h"]输入:["H","a","n","n","a","h"]
输出:["h","a","n","n","a","H"]题解
双指针
class Solution {
public void reverseString(char[] s) {
// 双指针方向题型,注意指针的初始化和循环条件
// 初始化左指针
int left = 0;
// 初始化右指针
int right = s.length - 1;
// 双指针反向,相遇条件是左右指针相遇
while (left <= right) {
// 交换元素
char temp = s[right];
s[right] = s[left];
s[left] = temp;
left ++;
right --;
}
}
}最后更新于