LeetCode 8 String to Integer (atoi)

问题

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.


分析

1 字符串转数字的处理

    1 字符串空字符串 和长度的判断,在处理的时候 长度的判断在trim之后处理比较好

    2 正数和负数的区分 比较好理解的代码设计是设置一个标记为sign 1 -1区别正负数

    3 越界的处理 通用的处理方式是 long类型来存储最后的结果

       最后返回强转回int


代码

public int myAtoi(String str) {
        if(str == null || str.length() == 0) return 0;
        str = str.trim();
        if(str.length() == 0) return 0;
        int start = 0;
        int sign = 1;
        char sc = str.charAt(0);
        if(sc == '+'){
            sign = 1;
            start++;
        }else if(sc == '-'){
            sign = -1;
            start++;
        }
        long res = 0;
        for(int i = start; i < str.length(); i++){
            if(!Character.isDigit(str.charAt(i))){
                return (int)res * sign;
            }
            res = res * 10 + str.charAt(i) - '0';
            if(sign == 1 && res > Integer.MAX_VALUE) return Integer.MAX_VALUE;
            if(sign == -1 && res > Integer.MAX_VALUE) return Integer.MIN_VALUE;
        }
        return (int)res * sign;   
    }


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值