344. Reverse String(in place-字符串操作)

problem：

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”]

tip:

翻转字符串。

solution:

1.使用栈的数据结构辅助。
2.使用双指针，从头和尾同时遍历并且交换。

class Solution {
public:
    void reverseString(vector<char>& s) {
        int n = s.size();
        int left =0,right = n-1;
        while(left < right)
        {
            char p = s[left];
            s[left++] = s[right];
            s[right--] = p;
        }
    }
};

3.将第二种方法的翻转部分使用swap函数实现。

swap(s[left++],s[right--]);