-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path344.reverse-string.cpp
More file actions
50 lines (49 loc) · 982 Bytes
/
344.reverse-string.cpp
File metadata and controls
50 lines (49 loc) · 982 Bytes
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
/*
* @lc app=leetcode id=344 lang=cpp
*
* [344] Reverse String
*
* https://leetcode.com/problems/reverse-string/description/
*
* algorithms
* Easy (75.48%)
* Likes: 5852
* Dislikes: 986
* Total Accepted: 1.8M
* Total Submissions: 2.3M
* Testcase Example: '["h","e","l","l","o"]'
*
* Write a function that reverses a string. The input string is given as an
* array of characters s.
*
* You must do this by modifying the input array in-place with O(1) extra
* memory.
*
*
* Example 1:
* Input: s = ["h","e","l","l","o"]
* Output: ["o","l","l","e","h"]
* Example 2:
* Input: s = ["H","a","n","n","a","h"]
* Output: ["h","a","n","n","a","H"]
*
*
* Constraints:
*
*
* 1 <= s.length <= 10^5
* s[i] is a printable ascii character.
*
*
*/
// @lc code=start
class Solution
{
public:
void reverseString(vector<char> &s)
{
for (int i = 0; i < s.size() / 2; i++)
swap(s[i], s[s.size() - 1 - i]);
}
};
// @lc code=end