zoukankan      html  css  js  c++  java
  • 8. 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:

    1. 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.
    2. 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.
    3. 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.
    4. 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.

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    class Solution {
    public:
        int myAtoi(string s) {
            int sign = 1, base = 0, i = 0;
            while (s[i] == ' ')++i;
            if (s[i] == '-' || s[i] == '+')
                sign = 1 - 2 * (s[i++] == '-');
     
            while (s[i] >= '0' && s[i] <= '9' && i <s.size()) {
                if (base > INT_MAX / 10 || (base == INT_MAX/10 && (s[i]-'0') > INT_MAX % 10)) {
                    if (sign == 1) return INT_MAX;
                    else return INT_MIN;
                }
                base = base * 10 + (s[i++] - '0');
            }
            return base*sign;
        }
    };





  • 相关阅读:
    [JSOI2009] 游戏
    CF1148H Holy Diver
    [提高组集训2021] 模拟赛3
    CF1458F Range Diameter Sum
    [游记] CSP2021
    CF1396E Distance Matching
    CF1396D Rainbow Rectangles
    【LeetCode】1. 两数之和
    【随笔】开通博客园过程
    MyISAM与InnoDB的区别是什么?
  • 原文地址:https://www.cnblogs.com/zhxshseu/p/6cf879f09994c683ab01f4c31ae52af9.html
Copyright © 2011-2022 走看看