每日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.

本题想法如下：读入字符串，先将给定的字符串中前面的空格去掉，然后遇到第一个非空格字符停下。

判断该非空格字符，若其为符号，则记录符号（注意符号最多一个），若其为数字，则将其放入准备好的字符串pure中，若为其他直接返回0。

接下来，遍历原字符串余下部分，在非数字的位置停下，或者遍历完了整个字符串停下。

遍历pure字符串，根据之前的符号构造数字。（这里对overfloat的判定做法类似于每日leetcode--(7) Reverse Integer中的做法）。

代码：

//
//  main.cpp
//  project_8
//
//  Created by 何斌 on 2018/8/19.
//  Copyright © 2018年 何斌. All rights reserved.
//

#include <iostream>
#include <fstream>
using namespace std;

class Solution {
public:
    int myAtoi(string str) {
        string pure = "";
        int ind = 0 ;
        bool ispos = true;
        for(;ind<str.size();ind++)
        {
            if(str[ind]==' ')continue;
            else break;
        }
        if(ind==str.size())return 0;
        else
        {
            if(str[ind]=='-')
            {
                ispos = false;
            }
            else if(str[ind] == '+')
            {
                ispos = true;
            }
            else if(str[ind]<='9'&&str[ind]>='0')
            {
                ispos = true;
                pure.append(1,str[ind]);
            }
            else
            {
                return 0;
            }
            ind++;
        }
        while(ind<str.size()&&str[ind]<='9'&&str[ind]>='0')
        {
            pure.append(1,str[ind]);
            ind++;
        }
        int res = 0;
        for(int i = 0;i<pure.size();i++)
        {
            int num = pure[i]-'0';
            if(ispos==false)
            {
                num*=-1;
            }
            res = res * 10 + num;
            if(i+1<pure.size()&&ispos&&(res>INT32_MAX/10||(res==INT32_MAX/10&&(pure[i+1]-'0')>(INT32_MAX%10))))
            {
                return INT32_MAX;
            }
            if(i+1<pure.size()&&!ispos&&(res<INT32_MIN/10||(res==INT32_MIN/10&&(pure[i+1]-'0')>-1*(INT32_MIN%10))))
            {
                return INT32_MIN;
            }
        }
        return res;
        
    }
};

int main(int argc, const char * argv[]) {
    
    ifstream in("input.txt");
    //freopen("input.txt","r",stdin);
    int total = 3;
    while(total--)
    {
        string s;
        getline(in, s);
        cout<<s<<endl;
        Solution solu;
        cout<<solu.myAtoi(s)<<endl;
    }
    return 0;
}

速度还能再快一点。待续。