LeetCode 8. String to Integer [字符串转换整数] (atoi) Python3

LeetCode 8. 字符串转换整数[String to Integer] (atoi) Python3

Description

点击查看题目
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.

问题分析

本题是一道中等题,题目的意思是字符串转换成整数,但是字符串不一定完全由数字和"+ -"号组成,需要你自己去判断,总结以下,有以下几点:

  • 如果字符串以"+“或者”-“开头,那么和后面尽可能多的数字进行结合,注意是数字,需要考虑” -+23"、"+"的情况
  • 遇到第一个非数字字符,转换终止
  • 如果转换后的范围超出int的存储范围,返回INT_MIN或者INT_MAX

我刚开始做这道题的时候,第二点和第三点都考虑到了,但第一点没有考虑到,结果反复修改提交了好几遍,面试的时候要是这样的话估计早就凉凉了。。。

另外,我之前一直在LeetCode官网提交,但是最近一直上不去,所以改到了力扣平台,如果之前的博客里面的网址无法访问了,可以在力扣平台提交。

代码实现

class Solution:
    def myAtoi(self, str: str) -> int:
        str = str.lstrip(" ")
        if not str:
            return 0
        if str == "-" or str == "+":
            return 0
        res = ""
        flag = False
        if str.startswith("-"):
            str = str[1:]
            res += "-"
            flag = True
        elif str.startswith("+"):
            str = str[1:]
            res += "+"
            flag = True
        elif "0" <= str[0] and str[0] <= "9":
            res += "+"
            flag = True
        if not flag:
            return 0
        while str and "0" <= str[0] and str[0] <= "9":
            res += str[0]
            str = str[1:]
        if len(res) > 1:
            result = int(res)
        else:
            result = 0
        if result < -2147483648:
            return -2147483648
        elif result > 2147483647:
            return 2147483647
        return result

运行结果

在这里插入图片描述
为了能通过,真的是改了又改,所以还需要多练习,考虑所有的情况,自己的路还有很长要走。

ok!大功告成了,如果你有其他的方法或者问题,欢迎在评论区交流。

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值