题目描述:
Write a function that reverses a string. The input string is given as an array of characters char[]
.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
You may assume all the characters consist of printable ascii characters.
Example 1:
Input: ["h","e","l","l","o"] Output: ["o","l","l","e","h"]
Example 2:
Input: ["H","a","n","n","a","h"] Output: ["h","a","n","n","a","H"]
中文理解:反转给定的一个字符数组。
解题思路:根据规律,只需swap(s[i],s[s.length-i-1])即可完成,同时空间复杂度O(1)。
代码(java):
class Solution {
public void reverseString(char[] s) {
int len=s.length;
char tmp;
for(int i=0;i<len/2;i++){
tmp=s[i];
s[i]=s[len-1-i];
s[len-i-1]=tmp;
}
}
}