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

     1 class Solution {
     2 public:
     3     int atoi(const char *str) {
     4         long long m=0;//long long 判断溢出
     5         int n=0,flag1=0,flag2=0,i=0;//flag1,flag2 对'+','-' 计数,i是总数,符号超过1个 出错 
     6         while(*str&&*str==' ')
     7             ++str;
     8         while(*str=='+'||*str == '-'){
     9             if(*str =='+'){
    10                 ++flag1;
    11                 ++i;
    12                 ++str;
    13             }else{
    14                 ++flag2;
    15                 ++i;
    16                 ++str;
    17             }
    18         }
    19         while(*str>47&&*str<58){
    20             n = *str -'0';
    21             m *=10;
    22             m += n;
    23             ++str;
    24         }
    25         if(i>1)
    26             m= 0;
    27         else if(flag2==1){
    28             m *= -1;
    29         }
    30         if(m>2147483647)
    31             m = 2147483647;
    32         else if(m < -2147483648)
    33             m = -2147483648;
    34         return m;
    35     }
    36 };
  • 相关阅读:
    Python基础之元组tuple(带了枷锁的列表)
    Python基础之元组tuple(带了枷锁的列表)
    Python基础之列表
    Python基础之列表
    穷举法解决这个问题(1,2)
    二分查找
    正則表達式
    Restful WebService简介
    杭电1285确定比赛名次
    ACdream区域赛指导赛之手速赛系列(5) 题解
  • 原文地址:https://www.cnblogs.com/ittinybird/p/4083092.html
Copyright © 2011-2022 走看看