Leetcode Q8 : String to Integer (atoi)

最新推荐文章于 2018-11-23 23:00:20 发布

sdu程序猿

最新推荐文章于 2018-11-23 23:00:20 发布

阅读量486

点赞数

分类专栏： Leetcode解法文章标签： leetcode string integer

本文链接：https://blog.csdn.net/qwe_lingkun/article/details/47099961

版权

Leetcode解法专栏收录该内容

20 篇文章 0 订阅

订阅专栏

题目8：

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.

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.

#define     INT_MAX     2147483647
#define     INT_MIN     (-2147483648)

/***************************************************************************************************
*\Function      MyAtoi
*\Description   string -> int
*\Parameter     str
*\Return        int
*\Note          
*\Log           2015.07.23    Ver 1.0    
*               创建函数。
***************************************************************************************************/
int myAtoi(char* str) 
{
    long long temp = 1;
    int i = 0;
    long long res = 0;
    int len = 0;
    int sym = 1;
    int res_size = 0;
    int count = 0;

    while (str[len] != '\0')
    {
        len++;
    }

    /* 去除头部空格 */
    while (*str == ' ')
    {
        str++;
        len--;
    }

    /* 判断是否有正负符号 */
    if (str[0] == '+' || str[0] == '-')
    {
        len--;
        if (str[0] == '-')
        {
            sym *= (-1);
        }
        str++;
    }


    /* 去除前面的0 */
    while (*str == '0' && len >= 1)
    {
        str++;
        len--;
    }

    /* 判断是否有特殊无用符号 */
    while (*str != '\0')
    {
        if (str[i] >= '0' && str[i] <= '9')
        {
            i++;
        }
        else
        {
            *(str+i) = '\0';
            break;
        }
    }
    len = i;

    for (i = len - 1; i >= 0; i--)
    {
        res = res + (long long)(str[i] - '0') * temp;
        count++;
        temp *= 10;
    }
    res *= sym;

    /* 计算res位数 */
    temp = res;
    while (temp != 0)
    {
        res_size++;
        temp /= 10;
    }


    /* 判断是否溢出 */
    /* 结果的位数发生改变 */
    if (res_size < count)
    {
        if (sym == 1)
        {
            return INT_MAX;
        }
        else
        {
            return INT_MIN;
        }
    }
    /* 结果的符号发生改变 */
    if (sym == 1 && res*sym < 0)
    {
        return INT_MAX;
    }
    if (sym == -1 && res*sym < 0)
    {
        return INT_MIN;
    }

    /* 结果超出范围 */
    if (res > INT_MAX)
    {
        return INT_MAX;
    }
    else
    {
        if (res < INT_MIN + 1)
        {
            return INT_MIN;
        }
    }

    return res;
}