class Solution {
public:
int strToInt(string str) {
int n=0;
long long a=0;int b=1;
while(n<str.size()&&str[n]==’ ‘)
n++;
if(n<str.size())
{
if(str[n]=='-')b=-1,n++;
else if(str[n]=='+')n++;
}
while(n<str.size()&&str[n]>='0'&&str[n]<='9')
{
a=a*10-'0'+str[n];
if(a>1e11)
{
break;}
n++;
}a*=b;
if(a>INT_MAX)
{
a=INT_MAX;}
if(a<INT_MIN){
a= INT_MIN; }
return a;
}
};