leetcode-string to integer

Implement atoi to convert a string to an integer.

Requirements for atoi:
The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.

The string can contain additional characters after those that form the integral number, which are ignored and have no effect on the behavior of this function.

If the first sequence of non-whitespace characters in str is not a valid integral number, or if no such sequence exists because either str is empty or it contains only whitespace characters, no conversion is performed.

If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX(2147483647) or INT_MIN (-2147483648) is returned.

#include 
#include 
#include 
using namespace std;

class Solution {
public:
    int atoi(const char *str) {
        vector stack;
        int i = 0;
        bool flag = true;
        int result = 0;
        const long MAX = 2147483647;
        const long MIN = -2147483648;

        while ((str[i] == ' ' || str[i] == '\t' || str[i] == '\r' )&& str[i] != '\0'){
            ++i;
        }
        if(str[i] == '\0'){
            return 0;
        }


        if(str[i] == '+'){
            ++i;
            flag = true;
        }
        else if(str[i] == '-'){
            flag = false;
            ++i;
        }
        

        while(isdigit(str[i])){
            stack.push_back(str[i] - '0');
            ++i;
        }

        for(int j = 0; j < stack.size(); ++j){
            result += stack[stack.size() - j - 1] * pow(10, j);
            if(result < 0){
                if(flag){
                    return MAX;
                }
                else{
                    return MIN;
                }
            }
        }
        
        if(!flag){
            result *= -1;
        }

        return result;
    }
};

int main(){
    char *p = "-9223372036854775809";
    Solution solution;
    solution.atoi(p);
    return 0;
}