LeetCode 8. String to Integer (atoi)

Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.

Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.

 

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.

从字符串中提取整数。只考虑简单情况就好，除掉开头的空格和一个可能存在的正负号，然后把紧跟的整数提取出来，遇到一个非数字后面就可以不管了。l是去掉前面的空格与正负号之后的位置，如果不是数字则可以直接返回0了，r是从l开始往右数字的末端，然后累加就可以，过程中要判断是否溢出。

class Solution {
public:
    int myAtoi(string str) {
        int len = str.length();
		if (len == 0) return 0;
		int ptr = 0;
		while (str[ptr] == ' ') {
			ptr++;
			if (ptr == len) return 0;
		}
		if (str[ptr] == '+' || str[ptr] == '-' || (str[ptr] >= '0'&&str[ptr] <= '9')) {
			int f = 1;
			if (str[ptr] == '-') {
				f = -1;
				ptr++;
			}
			else if (str[ptr] == '+') {
				ptr++;
			}
			if (!(str[ptr] >= '0'&&str[ptr] <= '9')) return 0;
			vector<int>v1;
			int l = ptr;
			while (l < len&&str[l] == '0') l++;
			if (l == len||!(str[l]>='0'&&str[l]<='9')) return 0;
			int r = l;
			while (r < len && (str[r] >= '0'&&str[r] <= '9')) r++;
			r--;
			if (r - l > 9)return f == 1 ? INT_MAX : INT_MIN;
			int ans = 0;
			while (l <= r) {
				ans *= 10;
				ans += str[l] - '0';
				if (ans < 0) {
					return f == 1 ? INT_MAX : INT_MIN;
				}
				l++;
			}
			ans *= f;
			return ans;
		}
		else {
			return 0;
		}
    }
};