• leetcode : String to Integer (atoi)


    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.

    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) 去除空格 trim()
    (2) 符号
    (3) 非数字  : 用char做加减法
    (4) 溢出, 可以用double保存临时处理结果
    (5) 空字符串
     
    public class Solution {
        public int myAtoi(String str) {
            
            if(str == null || str.length() == 0){
                return 0;
            }
            
            str = str.trim();
            char flag = '+';
            int i = 0;
            
            if(str.charAt(i) == '-'){
                flag = '-';
                 i++;
            }else if(str.charAt(i) == '+'){
    			i++;
    		}
           
            
            double result = 0;
            while(i < str.length()){
                if(str.charAt(i) < '0'||str.charAt(i) > '9') {
                    break;
                }
                result = result * 10 + str.charAt(i) - '0';
                i++;
            }
            
            if(flag == '-'){
                result = -result;
            }
            
            if(result > Integer.MAX_VALUE){
                return Integer.MAX_VALUE;
            }
            if(result < Integer.MIN_VALUE){
                return Integer.MIN_VALUE;
            }
            
            return (int)result;
            
        }
    }
    

      

  • 相关阅读:
    ZOJ2334 Monkey King 并查集 STL
    ZOJ2286 Sum of Divisors 筛选式打表
    ZOJ2105 终于找到错误
    ZOJ-2091-Mean of Subsequence (反证法的运用!!)
    【9929】潜水员
    【9928】混合背包
    【t077】宝物筛选
    【9927】庆功会
    【9926】完全背包
    【9925】0/1背包
  • 原文地址:https://www.cnblogs.com/superzhaochao/p/6377976.html
Copyright © 2020-2023  润新知