leetcode-344. 反转字符串

一.题目描述

二.第1次提交(std::reverse)

class Solution {public:void reverseString(vector<char> &s) {std::reverse(s.begin(), s.end());}
};

三.第2次提交(左右指针)

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

四.第3次提交(左右指针，swap函数)

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

五.第4次提交(左右指针)

class Solution {public:void reverseString(vector<char> &s) {for (int i = 0, j = s.size() - 1; i < s.size() / 2; i++, j--) {swap(s[i], s[j]);}}
};