zoukankan      html  css  js  c++  java
  • LeetCode——008 String to Integer (atoi)

    ** Description **

    Implement atoi which converts a string to an integer.

    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.

    Note:

    Only the space character ' ' is considered as whitespace character.
    Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.

    Example 1:

    Input: "42"
    Output: 42
    

    Example 2:

    Input: "   -42"
    Output: -42
    Explanation: The first non-whitespace character is '-', which is the minus sign.
                 Then take as many numerical digits as possible, which gets 42.
    

    Example 3:

    Input: "4193 with words"
    Output: 4193
    Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.
    

    Example 4:

    Input: "words and 987"
    Output: 0
    Explanation: The first non-whitespace character is 'w', which is not a numerical 
                 digit or a +/- sign. Therefore no valid conversion could be performed.
    

    Example 5:

    Input: "-91283472332"
    Output: -2147483648
    Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
                 Thefore INT_MIN (−231) is returned.
    
    Solution {
    public:
    	int myAtoi(string str) {
    		if (str.length() == 0)return 0;
    		double res = 0;//用来防止溢出的
    		bool isBegan = false; //是否开始了
    		int isMinus = 1;//是否是负数
    		for (int i = 0; i < str.length(); ++i)
    		{
    			if (!isBegan && str[i] == ' ')continue;//还没有开始
    			if (!isBegan && (str[i] == '-' || str[i] == '+'))//第一次遇到负号
    				isMinus = str[i] == '-' ? -1 : 1;//是负数
    			else if (isdigit(str[i]))
    				res = res * 10 + str[i] - '0';
    			else//不是数字
    				return res * isMinus;
    			isBegan = true;//开始了
    			//判断是否越界	
    			if ((res * isMinus) < INT_MIN)return INT_MIN;
    			else if (res * isMinus > INT_MAX)return INT_MAX;
    		}
    		return res * isMinus;
    	}
    };
    
  • 相关阅读:
    JetBrains全系列破解
    BZOJ 4817: [Sdoi2017]树点涂色 LCT + DFS序 + 线段树
    LOJ #6041. 「雅礼集训 2017 Day7」事情的相似度 LCT + SAM + 线段树
    Uoj 52. 【UR #4】元旦激光炮 交互题
    Uoj #218. 【UNR #1】火车管理 可持久化线段树+思维
    luoguP3979 遥远的国度 LCT + multiset维护子树信息
    BZOJ 4999: This Problem Is Too Simple! DFS序 + LCA + 树状数组 + 离线
    BZOJ 1787: [Ahoi2008]Meet 紧急集合
    BZOJ 2959: 长跑 LCT + 并查集 + 点双
    BZOJ 4259: 残缺的字符串 FFT
  • 原文地址:https://www.cnblogs.com/zzw1024/p/12334075.html
Copyright © 2011-2022 走看看