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

    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.

    class Solution {
    public:
        int atoi(const char *str) {
        if(0==strlen(str))
        return 0;
        int i=0;
        int flag=1;
        long long res=0;
        while (str[i]!=''&&str[i]==' ')
        {
            i++;
        }
        if (str[i]=='+')
        {
            i++;
        }
        else if(str[i]=='-')
        {
            flag=-1;
            i++;
        }
        while(str[i]>='0'&&str[i]<='9')
        {
            res=10*res+flag*(str[i]-'0');
            if (flag==-1)
            {
                res=(res<INT_MIN)?INT_MIN:res;
            } 
            else
            {
                res=(res>INT_MAX)?INT_MAX:res;
            }
            i++;
        }
        return (int)res;
        }
    };
  • 相关阅读:
    leetcode1118
    Kaggle练习002--Predict survival on the Titanic(Titanic Disaster)
    leetcode1111
    leetcode1110
    leetcode1109
    练习题|网络编程-socket开发
    web网页练习
    Bootstrap框架
    JQuery框架2.位置属性|筛选方法|事件
    Jquery框架1.选择器|效果图|属性、文档操作
  • 原文地址:https://www.cnblogs.com/Vae1990Silence/p/4283706.html
Copyright © 2011-2022 走看看