LeetCode——8. String to Integer (atoi)

1.题目详情

Implement atoi which converts a string to an integer.

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.

Note:

  • Only the space character ’ ’ is considered as whitespace character.
  • Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.

Example 1:

Input: “42”
Output: 42

Example 2:

Input: " -42"
Output: -42
Explanation: The first non-whitespace character is ‘-’, which is the minus sign.
Then take as many numerical digits as possible, which gets 42.

Example 3:

Input: “4193 with words”
Output: 4193
Explanation: Conversion stops at digit ‘3’ as the next character is not a numerical digit.

Example 4:

Input: “words and 987”
Output: 0
Explanation: The first non-whitespace character is ‘w’, which is not a numerical
digit or a +/- sign. Therefore no valid conversion could be performed.

Example 5:

Input: “-91283472332”
Output: -2147483648
Explanation: The number “-91283472332” is out of the range of a 32-bit signed integer.
Thefore INT_MIN (−231) is returned.

输入一个字符串,转换为数字输出。首先忽略前面所有的空格,然后可以接受一个"加号"或"减号",之后就尽可能的接受数字字符,将这些接受的字符转换为数字。

如果接受的字符个数为0或者只有符号位(即正负号),输出0;如果数字不在[-232, 232-1]的范围,则输出232-1或者-232

2.解题方法

class Solution {
public:
    int myAtoi(string str) {
        int result = 0;
        bool isPositive = true;
        int size = str.size();
        int index = 0;
        // 去除字符串前面的空格
        while (index < size && str[index] == ' ')
        	index++;
        // 考虑除去空格后第一个字符的影响
        char c = str[index];
        if (c == '-'){		// 如果是'-',则将isPositive标记为false,表示结果应该是负数
        	index = index + 1;
        	isPositive = false;
        }
        else if (c == '+'){	// 如果是'+',则将isPositive标记为true,表示结果应该是正数
        	index = index + 1;
        	isPositive = true;
        }
        else if (c > 57 || c < 48)	// 如果不是数字符号,则说明接受的字符个数为0,输出0
        	return 0;
        // 尽可能接受接下来的字符,用于转换成数字
        while (index < size) {
        	char c = str[index];
        	if (c > 47 && c < 58) {
        		int num = c - 48;
        		// 如果越界了,而且isPositive标记位为true,则返回INT_MAX
        		if (isPositive && (2147483647 / 10 < result || result == 214748364 && num > 7))
        			return 2147483647;
        		// 如果越界了,而且isPositive标记位为false,则返回INT_MIN
        		if (isPositive == false && (2147483648 / 10 < result || result == 214748364 && num > 8))
        			return -2147483648;
        		result = result * 10 + num;
        	}
        	else
        		break;
        	index = index + 1;
        }
        // 最后以标记位和接受的字符返回结果
        return isPositive ? result : 0 - result;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值