LeetCode
双指针
class Solution {
public void reverseString(char[] s) {
if(s == null || s.length == 1) return;
int j = s.length-1;
for(int i = 0; i< s.length/2; i++){
char temp = s[i];
s[i] = s[j];
s[j] = temp;
j--;
}
return;
}
}
没什么技术含量,直接遍历 一半的数组进行头尾交换