In the **Leetcode String to Integer (atoi) problem solution in C++ programming** Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++’s atoi function).

The algorithm for myAtoi(string s) is as follows:

Read in and ignore any leading whitespace.

Check if the next character (if not already at the end of the string) is ‘-‘ or ‘+’. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present.

Read in next the characters until the next non-digit character or the end of the input is reached. The rest of the string is ignored.

Convert these digits into an integer (i.e. “123” -> 123, “0032” -> 32). If no digits were read, then the integer is 0. Change the sign as necessary (from step 2).

If the integer is out of the 32-bit signed integer range [-231, 231 – 1], then clamp the integer so that it remains in the range. Specifically, integers less than -231 should be clamped to -231, and integers greater than 231 – 1 should be clamped to 231 – 1.

Return the integer as the final result.

**Leetcode String to Integer (atoi) problem solution in C++ programming**

```
class Solution {
public:
int myAtoi(string str) {
int i = 0, res = 0, sign = 1;
while(i < str.size() and str[i] == ' ') i++;
if(i < str.size() and str[i] == '-' or str[i] == '+')
sign = str[i++] == '-' ? -1: 1;
while(i < str.size() and isdigit(str[i])) {
if(res > INT_MAX/10 or (res *10 > INT_MAX - (str[i] - '0')))
return sign == 1 ? INT_MAX : INT_MIN;
res = res*10 + (str[i++] - '0');
}
return sign *res;
}
};
```

**Also read,**

- Leetcode String to Integer (atoi) problem solution in C
- Leetcode String to Integer (atoi) problem solution in Java
- Leetcode String to Integer (atoi) problem solution in Python
- Leetcode String to Integer (atoi) problem solution in C#