递归实现字符串逆序

#include <string>
#include <iostream>
 
using namespace std;
 
void Reverse(string &s, int index)
{
    static string copy_str = string(s.length(), '\0');
 
    if (index == s.length())
    {
        cout << copy_str << endl;
        return;
    }
     
    copy_str[index] = s[s.length()-index-1];
     
    Reverse(s, index+1);
}
int main(void)
{
    string s = "abc";
    Reverse(s, 0);
     
    return 0;
}


#include <string>
#include <iostream>