解题思路
344. 反转字符串
简单的数组倒序算法
代码
数组倒序
class Solution {
public static void reverseString(char[] s) {
char temp =' ';
for(int i=0;i<s.length/2;i++) {
temp = s[i];
s[i] = s[s.length-i-1];
s[s.length-i-1] = temp;
}
}
}
双指针
//双指针
public static void reverseString2(char[] s) {
int n = s.length;
char temp =' ';
for (int left = 0, right = n - 1; left < right; ++left, --right) {
temp = s[left];
s[left] = s[right];
s[right] = temp;
}
}