Home
How to Reverse String in C++?
Tags:, ,

How to Reverse String in C++?

April 23, 2016 No Comments algorithms, c / c++, string

Write a method that reverses the given input string. Example: Given s = “12345”, return “54321”.

STL

The C++ STL provides the reverse method that does the job.

1
2
3
4
5
6
7

class Solution {
public:
    string reverseString(string s) {
        reverse(s.begin(), s.end());
        return s;
    }
};
class Solution {
public:
    string reverseString(string s) {
        reverse(s.begin(), s.end());
        return s;
    }
};

The string constructor takes the iterator so we can use rbegin() and rend() in which the ‘r’ means reversed.

1
2
3
4
5
6
7

class Solution {
public:
    string reverseString(string s) {
        auto x = string(s.rbegin(), s.rend());
        return x;
    }
};
class Solution {
public:
    string reverseString(string s) {
        auto x = string(s.rbegin(), s.rend());
        return x;
    }
};

Two Pointers

We initialize two pointers, from the start and end respectively. Swap two characters until these pointers meet in the middle. O(n) complexity.

1
2
3
4
5
6
7
8
9
10

class Solution {
public:
    string reverseString(string s) {
        int i = 0, j = s.length() - 1;
        while (i < j) {
            swap(s[i++], s[j--]);
        }
        return s;
    }
};
class Solution {
public:
    string reverseString(string s) {
        int i = 0, j = s.length() - 1;
        while (i < j) {
            swap(s[i++], s[j--]);
        }
        return s;
    }
};

Make a Copy

If we make a copy, we can re-assign the reverse characters easily. O(n) complexity.

1
2
3
4
5
6
7
8
9
10

class Solution {
public:
    string reverseString(string s) {
        string x = s;
        for (int i = 0; i < s.length(); i ++) {
            x[i] = s[s.length() - i - 1];
        }
        return x;
    }
};
class Solution {
public:
    string reverseString(string s) {
        string x = s;
        for (int i = 0; i < s.length(); i ++) {
            x[i] = s[s.length() - i - 1];
        }
        return x;
    }
};

Add Character Reverse

Another way is to add character in the reverse order.

1
2
3
4
5
6
7
8
9
10

class Solution {
public:
    string reverseString(string s) {
        string x = "";
        for (int i = 0; i < s.length(); i ++) {
            x = s[i] + x;
        }
        return x;
    }
};
class Solution {
public:
    string reverseString(string s) {
        string x = "";
        for (int i = 0; i < s.length(); i ++) {
            x = s[i] + x;
        }
        return x;
    }
};

See also: Reverse a Sentence (Sentence Reversal Algorithm)

–EOF (The Ultimate Computing & Technology Blog) —

GD Star Rating
loading...
319 words
Last Post: Last Minute Tips before Phone Interview
Next Post: Dynamic Programming - Integer Break

The Permanent URL is: How to Reverse String in C++?

Related posts:

  1. Pointer Arithmetic in Delphi Delphi is based on Object Pascal, which is a great programming language. Delphi is also...
  2. Algorithm to Compute the Fraction to Recurring Decimal of the Two Integer Division Given two integers representing the numerator and denominator of a fraction, return the fraction in...
  3. Design a Logger Rate Limiter in C++/Java Design a logger system that receive stream of messages along with its timestamps, each message...
  4. The USB Flash Benchmark Tool – FlashBench Previously, it is recommended that the USBCheck can be quite helpful in checking the quality...
  5. Multithreading Testing using Pythons’ Low Level _threading Module In Python, we can use _threading to launch a thread easily using the _thread.start_new_thread procedure....
  6. Two Pointer and Sliding Window Algorithm to Find K-Length Substrings With No Repeated Characters Given a string S, return the number of substrings of length K with no repeated...
  7. SQL Coding Exercise – Find Department Highest Salary Submit your solution: https://leetcode.com/problems/department-highest-salary/ As seen, two tables, you are asked to list the highest...
  8. How to Generate Parentheses using Bruteforce or Depth First Search (Backtracking) Algorithms? Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses....

Leave a Reply