-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path344.ReverseString.cpp
62 lines (59 loc) · 1.14 KB
/
344.ReverseString.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*
* @lc app=leetcode id=344 lang=cpp
*
* [344] Reverse String
*
* https://leetcode.com/problems/reverse-string/description/
*
* algorithms
* Easy (68.35%)
* Likes: 1611
* Dislikes: 714
* Total Accepted: 817.2K
* Total Submissions: 1.2M
* Testcase Example: '["h","e","l","l","o"]'
*
* 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"]
*
*
*
*
*/
// @lc code=start
#include <vector>
class Solution {
public:
void reverseString(std::vector<char>& s) {
int front = 0, back = s.size() - 1;
while (front < back) {
std::swap(s[front], s[back]);
front++;
back--;
}
}
};
// @lc code=end