zoukankan      html  css  js  c++  java
  • 【LeetCode】8. String to Integer (atoi)

    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.

    第一步:跳过空格

    第二步:确定正负

    第三步:逐位取出,并检查溢出。

    其中检查溢出最简单的办法就是升为64位,这样当溢出int时立刻就能判断返回结果。

    class Solution {
    public:
        int atoi(const char *str) {
            long long res = 0;
            int sign = 1;
            //skip whitespace
            while(*str != 0 && *str == ' ')
                str ++;
            if(*str == 0)
                return 0;
            //sign
            if(*str == '-')
            {
                str ++;
                sign = -1;
            }
            else if(*str == '+')
                str ++;
            //skip leading 0's
            while(*str != 0 && *str == '0')
                str ++;
            if(*str == 0)
                return 0;
            //non-digit
            if(*str < '0' || *str > '9')
                return 0;
            while(*str != 0 && (*str >= '0' && *str <= '9'))
            {
                res *= 10;
                res += *str - '0';
                str ++;
                if(sign == 1 && res >= INT_MAX)
                    return INT_MAX;
                if(sign == -1 && res > INT_MAX)
                    return INT_MIN;
            }
            //end or non-digit
            return res * sign;
        }
    };

  • 相关阅读:
    [剑指Offer]判断一棵树为平衡二叉树(递归)
    [HDOJ]Coin Change(DP)
    01背包、完全背包
    [CodeForces_618C]Constellation
    [Codeforces_713A]Sonya and Queries
    C++位运算符
    [codeforces_597B] Restaurant(贪心)
    [LeetCode_98]Validate Binary Search Tree
    [LeetCode_96] Unique Binary Search Trees
    [LeetCode_105]Construct Binary Tree from Preorder and Inorder Traversal
  • 原文地址:https://www.cnblogs.com/ganganloveu/p/4177816.html
Copyright © 2011-2022 走看看