String to Integer (atoi)

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.

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.

题目的意思就是实现atoi的功能

几个细节要处理:

字符串开始部分为空串,如“     123”,返回数字部分;
字符串中包含非数字,如“+123a45”,返回第一个非数字前的有效数字部分;

最后考虑溢出的情况,转换保留数字用long long,用于和INT_MAX INT_MIN比较

#include<iostream>
#include<cmath>
#include<climits>
#include<cstring>
using namespace::std;
class Solution {
public:
    int atoi(const char *str)
    {
        int len = strlen(str);
        long long res = 0;//声明long long处理溢出状态
        int index = 0;
        int flag = 1; //符号标识
        //处理开始的空格
        //"    123";
        while(index<len && *(str+index)== ' ')
        {
            index++;
            //str++;
        }
        if(index == len) return 0;
        //处理符号
        //“+123”“-123”
        if(str[index] == '+')
        {
            flag = 1;
            index++;
        }
        if(str[index] == '-')
        {
            flag = -1;
            index++;
        }
        while(index < len)
        {
            char c = *(str+index);
            if(c>='0'&&c<='9')
                res = res*10+flag*(c-'0'); //符号位一起处理
            else
                break;
            if(res > INT_MAX) return INT_MAX; // 上溢出时,返回最大整数
            else if(res < INT_MIN) return INT_MIN; // 下溢出时,返回最小整
            index++;
        }
        return (int)res;
    }
};
int main()
{
    char *str = "  123";
    Solution so;
    cout<<so.atoi(str);
}


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值