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.

    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.

    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.

    Runtime: 22ms

    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 myAtoi(string str) {
     4         long long result = 0;
     5         int index = 0;
     6         while (index < str.size() && str[index] == ' ')
     7             index++;
     8         
     9         int sign = 1;
    10         while (index < str.size()) {
    11             if (str[index] == '+' || str[index] == '-') {
    12                 sign = str[index] == '+' ? 1 : -1;
    13                 index++;
    14             }
    15             
    16             while (index < str.size() && isdigit(str[index])) {
    17                 result = 10 * result + (str[index++] - '0');
    18                 if (sign * result > INT_MAX) return INT_MAX;
    19                 if (sign * result < INT_MIN) return INT_MIN;
    20             }
    21             return sign * (int)(result);
    22         }
    23         return sign * (int)(result);
    24     }
    25 };
  • 相关阅读:
    AndroidUI的组成部分ProgressBar
    NVIDIA+关联2015写学校招收评论(嵌入式方向,上海)
    谈论json
    排序算法(三):插入排序
    逻辑地址、线性地址、物理地址以及虚拟存储器
    逻辑地址、线性地址和物理地址的关系
    堆和栈都是虚拟地址空间上的概念
    缺页异常详解
    虚拟内存-插入中间层思想
    深入理解计算机系统之虚拟存储器
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/5918537.html
Copyright © 2011-2022 走看看