leetcode #8

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。注意,若整数范围超过[-2^32,2^32-1],返回-2^32或2^32-1。
题目解析:
    整数的起点为第一个非空字符,可用一个循环除去字符串前面的空字符。之后判断第一个字符是否为符号位。若是,用一个变量记录之,否则若为数字,用一个循环将该数字及之后的数字储存在列表中。 再用一些列表的方法把列表转化为数字并比较它是否超出范围,返回对应的整数。若该字符不是数字,返回0。
代码:
class Solution:
    def myAtoi(self, str):
        """
        :type str: str
        :rtype: int
        """
        str_list = list(str)
        sign = 1
        digit = []
        while str_list and str_list[0] == ' ':
            str_list.pop(0)
        if str_list and str_list[0] == '+':
            sign = 1
            str_list.pop(0)
        elif str_list and str_list[0] == '-':
            sign = -1
            str_list.pop(0)
        while str_list and str_list[0].isdigit() == True:
            digit.append(str_list[0])
            str_list.pop(0)
        if digit:
            if int("".join(digit))*sign < -2**31:
                return -2**31
            elif int("".join(digit))*sign > 2**31-1:
                return 2**31-1
            else:
                return int("".join(digit))*sign
        else:
            return 0

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值