leetcode:String to Integer (atoi) 字符串转化成整数

winxp,vc6.0


测试用例:“     123”;“    +123”; “   -12345”;“-10.0” 

对于测试用例“2147483648

我的函数和系统自带的atoi都输出了-2147483648

而leetcode却要求输出2147483647


看了一下题目的hint才发现

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.

很显然,题目说如果超过INT_MAX 就返回 INT_MAX, 如果小于 INT_MIN,就返回 INT_MIN

都是坑啊


class Solution {

public:
	int atoi( char *str)
	{

        if(str==NULL)
		return 0;
	

    int sum=0;
	int i=0;
	//判断符号
	bool isMinus=false;

	while(*(str+i)!='\0' && *(str+i)==' ')
		++i;

	if(*(str+i)=='+')
		++i;
	else if(*(str+i)=='-')
	{
		isMinus = true;
		++i;
	}
	while(*(str+i)!='\0' && *(str+i)>='0' && *(str+i)<='9')
	{
		sum = sum *10 + *(str+i) - '0';
		++i;
	}
	if(isMinus)
		return -sum;
	
	return sum;


	}
    

};

int main()
{
	Solution su;
	printf("%d\n",atoi("2147483648"));
	printf("%d\n",su.atoi("2147483648"));

	return 0;
}


最后的AC结果,,我也是晕了,VC++6.0不可以用long long ,因此在循环里的判断跳不过去


class Solution {
public:
	int atoi(const char *str)
	{

        if(str==NULL)
		return 0;


    long long sum=0;
	int i=0;
	//判断符号
	bool isMinus=false;

	while(*(str+i)!='\0' && *(str+i)==' ')
		++i;

	if(*(str+i)=='+')
		++i;
	else if(*(str+i)=='-')
	{
		isMinus = true;
		++i;
	}
	while(*(str+i)!='\0' && *(str+i)>='0' && *(str+i)<='9')
	{
		sum = sum *10 + *(str+i) - '0';
		++i;
		
		if(sum> INT_MAX)
		{
			return isMinus==true ? INT_MIN:INT_MAX;
		}
	}
	if(isMinus)
		return -sum;
	
	return sum;
	}
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值