zoukankan      html  css  js  c++  java
  • LeetCood8:String to Integer

    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.

    int myAtoi(char* str)
    {
        int index=0;
        int is_positive = 1;
        long long result=0;
        long long LONG_INT_MIN_ABS = INT_MIN;
        LONG_INT_MIN_ABS = 0-LONG_INT_MIN_ABS;
        
        while(str[index] == ' ')
        {
            index++;
        }
        if(str[index] == '')
        {
            return 0;
        }
        
        if(str[index] == '+')
        {
            index++;
        }
        else if(str[index] == '-')
        {
            is_positive = 0;
            index++;
        }
        else if((str[index]-'0' >= 0)&&(str[index]-'0' <= 9))
        {
            is_positive = 1;
        }else{
            return 0;
        }
        
        while((str[index]-'0'>=0)&&(str[index]-'0' <=9))
        {
            result=result*10+(str[index]-'0');
            index++;
            if(result>INT_MAX && is_positive==1)
            {
                return INT_MAX;
            }else if(result>LONG_INT_MIN_ABS && is_positive==0)
            {
                return INT_MIN;
            }
        }
        if(is_positive==0)
        {
            return -(int)result;
        }else{
            return (int)result;
        }
    } 
     
  • 相关阅读:
    第二阶段Sprint冲刺会议8
    第二阶段Sprint冲刺会议7
    第二阶段Sprint冲刺会议6
    问题账户需求分析
    2016年秋季个人阅读计划
    应该怎么做需求分析--读后感
    个人总结
    人月神话第三篇阅读笔记
    第十六周学习进度
    人月神话第二篇阅读笔记
  • 原文地址:https://www.cnblogs.com/evansyang/p/5240879.html
Copyright © 2011-2022 走看看