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

    最佳答案:

     1 private static final int maxDiv10 = Integer.MAX_VALUE / 10;
     2 
     3 public int atoi(String str) {
     4    int n = str.length();
     5    int i = 0;
     6    while (i < n && Character.isWhitespace(str.charAt(i))) i++;
     7    int sign = 1;
     8    if (i < n && str.charAt(i) == '+') {
     9       i++;
    10    } else if (i < n && str.charAt(i) == '-') {
    11       sign = -1;
    12       i++;
    13    }
    14    int num = 0;
    15    while (i < n && Character.isDigit(str.charAt(i))) {
    16       int digit = Character.getNumericValue(str.charAt(i));
    17       if (num > maxDiv10 || num == maxDiv10 && digit >= 8) {
    18          return sign == 1 ? Integer.MAX_VALUE : Integer.MIN_VALUE;
    19       }
    20       num = num * 10 + digit;
    21       i++;
    22    }  
    23    return sign * num;
    24 }
  • 相关阅读:
    记事本:js简介
    python 类的魔法函数 内置函数 类方法 静态方法 抽象类
    python 类
    python 列表 元组 字典 集合
    python:函数和循环判断
    记事本:盒模型
    第5章学习小结
    倍增法求LCA(最近公共最先)
    L
    第4章学习小结
  • 原文地址:https://www.cnblogs.com/birdhack/p/4122285.html
Copyright © 2011-2022 走看看