How to reverse a string using LeetCode
How to use LeetCode to reverse strings, for this problem, this article introduces the corresponding analysis and answers in detail, hoping to help more partners who want to solve this problem to find a more simple and easy way.
Topic description
Write a function that reverses the input string.
Example 1:
Enter: "hello"
Output: "olleh"
Example 2:
Enter: "A man, a plan, a canal: Panama"
Output: "amanaP: lanac a, nalp a, nam A"
Train of thought analysis
Go directly from the two ends to the middle and exchange the characters on both sides at the same time.
Animation demonstration
Animation demo reference code 1 stroke / 344. Reverse String
2max / https://leetcode.com/problems/reverse-string/description/
3// Two Pointers
4max / time complexity: O (n)
5max / space complexity: O (1)
6class Solution {
7public:
8 string reverseString (string s) {
nine
10 int I = 0, j = s.size ()-1
11 while (I
< j){ 12 swap(s[i], s[j]); 13 i ++; 14 j --; 15 } 16 17 return s; 18 } 19}; 代码截图
This is the answer to the question about how to use LeetCode to reverse strings. I hope the above content can be of some help to you. If you still have a lot of doubts to solve, you can follow the industry information channel for more related knowledge.
