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.


    思路:

    实现字符串转换为int型整数并不难,仅仅是有好多中输入情况须要考虑,easy造成遗漏。

    首先看一下c++ 中atoi的定义:

    -----------------------------------

    atoi

    int atoi (const char * str);
    Convert string to integer
    Parses the C-string str interpreting its content as an integral number, which is returned as a value of type int.

    The function first discards as many whitespace characters (as in isspace) 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 base-10 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 and zero is returned.


    Return Value

    On success, the function returns the converted integral number as an int value.
    If the converted value would be out of the range of representable values by an int, it causes undefined behavior. See strtol for a more robust cross-platform alternative when this is a possibility.

    ------------------------------------------

    能够看出须要注意的有下面几点:

    1. 去掉前面的空格
    2. 注意開始时候的符号 + -
    3. 忽略数字后面的杂七杂八字符
    4. 考虑溢出的情况。


    考虑了上面几方面。代码就能够AC了。


    代码:

    public class String_To_Integer { //java
    	public static int atoi(String str) {
    		int haveMinus = 1;
    		long result = 0;  
    		
    		if(str == null || str.trim().isEmpty())
    			return 0;
    		
    		//chech + - 
    		str = str.trim();
    		if(str.charAt(0) == '-'){
    			str = str.substring(1);
    			haveMinus = -1;
    		}else if(str.charAt(0) == '+')
    			str = str.substring(1);
    		
    		//check num
    		for(int i = 0;i < str.length() && str.charAt(i) >= '0' && str.charAt(i) <= '9'; i++){
    			result = result*10 + (str.charAt(i)- '0');
    		}
    		
    		//deal overflow
    		if(result > 2147483647 && haveMinus == 1)
    			return 2147483647;
    		if(result > 2147483647 && haveMinus == -1)
    			return -2147483648;
    		
    		return haveMinus*(int)result;
        }
    	
    	public static void main(String [] args){
    		System.out.println(String_To_Integer.atoi("2147483648"));
    	}
    }
    


  • 相关阅读:
    区块链|肖臻《区块链技术与应用》公开课之以太坊篇
    区块链|肖臻《区块链技术与应用》公开课之比特币篇
    复合数据类型
    广播变量和累加器
    mysql_基本操作
    8.10 NOI模拟赛 fzhtql SAM 后缀数组 启发式合并 dsu on tree 树状数组 set 线段树合并
    心态
    7.29 NOI 模拟赛 Stars 状压 dp
    8.2 NOI模拟赛 Palindrome dp 组合计数 分类讨论
    7.30 NOI模拟赛 B Easy Sum 分块 NTT
  • 原文地址:https://www.cnblogs.com/cxchanpin/p/6931627.html
Copyright © 2011-2022 走看看