编写函数viod reverse(string &s),用递归算法使字符串s倒叙

#include <iostream>
#include <cmath>
#include <string>
using namespace std;
void reverse(string &s){
	static a=0,b=s.length()-1,len=s.length()-2;
	if(len==0 || len==1)
		return ;
	else{
		swap(s[a],s[b]);
		a++;
		b--;
		len-=2;
		reverse(s);
		return ;
	}		
}
int main(){
	string str;
	cin>>str;
	reverse(str);
	cout<<str<<endl;
	return 0;
}