博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
leetcode 8. String to Integer (atoi)
阅读量:4486 次
发布时间:2019-06-08

本文共 2994 字,大约阅读时间需要 9 分钟。

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: -42Explanation: 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: 4193Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.

Example 4:

Input: "words and 987"Output: 0Explanation: 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: -2147483648Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.             Thefore INT_MIN (−231) is returned.

 

调bug欲仙欲死.....特别是调溢出的时候

class Solution {    public int myAtoi(String str) {        int index = 0, sign = 1, total = 0;        //1. Empty string        if(str.length() == 0) return 0;        //2. Remove Spaces        while(index < str.length() && str.charAt(index) == ' ' )            index ++;        //3. Handle signs        if((index < str.length()) && (str.charAt(index) == '+' || str.charAt(index) == '-')){            sign = str.charAt(index) == '+' ? 1 : -1;            index ++;        }        //4. Convert number and avoid overflow        while(index < str.length()){            int digit = str.charAt(index) - '0'; //先把digit取出来是个很好的方法            if(digit < 0 || digit > 9) break; //表示digit不为数字                //check if total will be overflow after 10 times and add digit            if(Integer.MAX_VALUE/10 < total || Integer.MAX_VALUE/10 == total && Integer.MAX_VALUE %10 < digit)                return sign == 1 ? Integer.MAX_VALUE : Integer.MIN_VALUE;            total = 10 * total + digit;            index ++;        }        return total * sign;    }}

 

转载于:https://www.cnblogs.com/jamieliu/p/10363232.html

你可能感兴趣的文章
洛谷 P3871 [TJOI2010]中位数
查看>>
洛谷 P2073 送花
查看>>
洛谷 P1801 黑匣子_NOI导刊2010提高(06)
查看>>
洛谷 P1503 鬼子进村
查看>>
E. The shortest problem
查看>>
进制转换——9018——1065
查看>>
老男孩Python全栈开发(92天全)视频教程 自学笔记21
查看>>
ASP.NET页面传值之Server.Transfer 和Response.Direct
查看>>
git随笔
查看>>
codeforces 985C. Liebig's Barrels
查看>>
获取URL参数
查看>>
异步数据处理Handler
查看>>
线段树lazy标记??Hdu4902
查看>>
Google Map API 学习四
查看>>
Hibernate入门1
查看>>
filbeat遇到的坑(运行久和文件数据量多时候 )
查看>>
jQuery插件学习笔记
查看>>
知识梳理HTML篇
查看>>
SQL关键字-exists
查看>>
每天一个linux命令(42):kill命令
查看>>