leetcode - String to Integer (atoi)

最新推荐文章于 2023-03-05 22:35:41 发布

le119126

最新推荐文章于 2023-03-05 22:35:41 发布

阅读量429

点赞数

分类专栏：算法 c++ 文章标签： leetcode 面试

本文链接：https://blog.csdn.net/le119126/article/details/45849359

版权

c++ 同时被 2 个专栏收录

104 篇文章 0 订阅

订阅专栏

算法

96 篇文章 0 订阅

订阅专栏

Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.

Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.

Update (2015-02-10):
The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button to reset your code definition.

spoilers alert... click to show requirements for atoi.

Requirements for atoi:

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. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.

注意：空格 --首尾都要考虑、符号--正负无都要考虑、溢出--正负溢出两种（负的2147483648不是溢出）、错误字符

#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       

using namespace std;

class Solution {
public:
    int myAtoi(string str) {
                int len=str.size();
                int j=1;
                if(len==0)
                        return 0;
                long value=0;
                int flag=1;//正
                int isFlow=0;//溢出
                int i=0;
                while(str[i]==' ')//开始含有空格
                        i++;
                if(str[i]=='-')
                {
                        flag=0;
                        i++;
                }
                else if(str[i]=='+')
                {
                        flag=1;
                        i++;
                }
                while(i