编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 char[]
的形式给出。
不要给另外的数组分配额外的空间,你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
你可以假设数组中的所有字符都是 ASCII 码表中的可打印字符。
示例 1:
输入:["h","e","l","l","o"]
输出:["o","l","l","e","h"]
示例 2:
输入:["H","a","n","n","a","h"]
输出:["h","a","n","n","a","H"]
这道题简单,我给的算法如下:
public static void reverseString(char[] s) {
if (null == s || s.length <= 1) {
return;
}
int len = s.length;
int index = len;
char temp = 'a';
for (int i = 0; i < len / 2; i++) {
temp = s[i];
s[i] = s[index - 1];
s[index - 1] = temp;
index--;
}
}
另外一种写法,思路其实一样
public static void reverseString2(char[] s) {
int start = 0;
int end = s.length - 1;
while (start < end) {
char temp = s[start];
s[start] = s[end];
s[end] = temp;
start++;
end--;
}
}
网友评论