Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
45 lines (43 sloc) 1.03 KB
/*
* @lc app=leetcode.cn id=344 lang=cpp
*
* [344] 反转字符串
*
* https://leetcode-cn.com/problems/reverse-string/description/
*
* algorithms
* Easy (65.03%)
* Total Accepted: 42.6K
* Total Submissions: 65.2K
* Testcase Example: '["h","e","l","l","o"]'
*
* 编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 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"]
*
*/
//双指针 O(1) space
class Solution {
public:
void reverseString(vector<char>& s) {
if (s.empty()) return;//1.
int f = 0, l = s.size() - 1;
while (f<l)
swap(s[f++], s[l--]);
}
};
You can’t perform that action at this time.