[算法练习]String to Integer (atoi)

Posted Quincy

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[算法练习]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.

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.

 

程序代码:

#include <gtest/gtest.h>
using namespace std;

int myAtoi(string str)
{    
    int nLength = str.length();
    if (nLength == 0)
    {
        return 0;
    }

    char* pszData = (char*)str.c_str();
    for (int i=0; i<nLength; ++i)
    {
        if (  != *pszData)
        {
            break;
        }

        ++pszData;
    }

    // Positive or negative
    int nFlag = 1;
    if (+ == *pszData)
    {
        ++pszData;
    }
    else if(- == *pszData)
    {
        nFlag = -1;
        ++pszData;
    }

    // ignore base case. 
    char cValue;
    long long nResult = 0;
    while( (cValue = *pszData) != \0)
    {
        if ( (cValue >= 0) && (cValue <= 9))
        {
            nResult = nResult * 10 + cValue - 0;
        }
        else
        {
            break;
        }

        if (nResult > 0x80000000)
        {
            break;
        }

        ++pszData;
    }
    
    nResult *= nFlag;    
    if (nResult > std::numeric_limits<int>::max())
    {
        nResult = std::numeric_limits<int>::max();        
    }
    else if(nResult < std::numeric_limits<int>::min())
    {
        nResult = std::numeric_limits<int>::min();
    }

    return (long)nResult;
}

TEST(Pratices, tMyAtoi)
{
    // 123 
    ASSERT_EQ(myAtoi("123"),123);
    ASSERT_EQ(myAtoi("-123123"),-123123);
    ASSERT_EQ(myAtoi("-123123abdf"),-123123);
    ASSERT_EQ(myAtoi("2147483648"),2147483647);
    ASSERT_EQ(myAtoi("2147483647"),2147483647);
    ASSERT_EQ(myAtoi("-2147483649"),-2147483648);
    ASSERT_EQ(myAtoi("9223372036854775809"),2147483647);
    
}

以上是关于[算法练习]String to Integer (atoi)的主要内容,如果未能解决你的问题,请参考以下文章

Kotlin实现LeetCode算法题之String to Integer (atoi)

[数学] leetcode 8 String to Integer (atoi)

算法练习-排序算法

LeetCode-面试算法经典-Java实现008-String to Integer (atoi) (字符串转成整数)

LeetCode-8-String to Integer (atoi)

No.008:String to Integer (atoi)