leetcode romanToInt

#include<iostream>
#include<unordered_map>
#include<string>
using namespace std;
string intToRoman(int num)
{
if(num>3999||num<1)
return string("the num is out of range");
unordered_map<int,string> map;
map[1000]="M";
map[900]="CM";
map[500]="D";
map[400]="CD";
map[100]="C";
map[90]="XC";
map[50]="L";
map[40]="XL";
map[10]="X";
map[9]="IX";
map[5]="V";
map[4]="IV";
map[1]="I";
string result;
unordered_map<int,string>::iterator iter=map.begin();
while(num>0)
{
int i=iter->first;
int count=num/i;
num%=i;
for(;count>0;--count)
{
result+=map[i];
}
++iter;
}
return result;
}
int romanToInt(string s)
{
if(s=="\0")
return 0;
unordered_map<char,int> map;
map['M']=1000;
map['D']=500;
map['C']=100;
map['L']=50;
map['X']=10;
map['V']=5;
map['I']=1;
int result=0;
for(size_t i=0;i<s.size();++i)
{
if(i>0&&(map[s[i]]>map[s[i-1]]))
{
result+=map[s[i]]-2*map[s[i-1]];
}
else
{
result+=map[s[i]];
}
}
return result;
}






int main()
{
string s=intToRoman(1234);
cout<<s<<"\t"<<romanToInt(s)<<endl;
return 0;
}