Add Binary--LeetCode

最新推荐文章于 2024-10-05 22:19:52 发布

鱼思故渊

最新推荐文章于 2024-10-05 22:19:52 发布

阅读量632

点赞数

分类专栏： LeetCode 文章标签： C++ LeetCode 算法

本文链接：https://blog.csdn.net/yusiguyuan/article/details/44888039

版权

LeetCode 专栏收录该内容

164 篇文章 3 订阅

订阅专栏

题目：

Given two binary strings, return their sum (also a binary string).

For example,
a = "11"
b = "1"
Return "100".

思路：字符串的叠加，注意进位

string AddBinary(string& first,string& second)
{
	string result;
	int carray =0;
	int i=first.length()-1;
	int j = second.length()-1;
	int tmp;
	for(;i>=0&&j>=0;i--,j--)
	{
		if(first[i] >='2' || second[j]>='2')
			return result;
		tmp = carray+(first[i]-'0')+(second[j]-'0');
		if(tmp >=2)
		{
			carray =1;
			tmp =0;
		}
		else
			carray =0;
		result += char(tmp+'0');
		
	}
	for(;i>=0;i--)
	{
		if(carray ==0)
			result += first[i];
		else
		{
			tmp = carray+(first[i]-'0');
			if(tmp >=2)
			{
				carray =1;
				tmp =0;
			}
			else
				carray =0;
			result += char(tmp+'0');
		}
	}
	
	for(;j>=0;j--)
	{
		if(carray ==0)
			result += second[j];
		else
		{
			tmp = carray+(second[j]-'0');
			if(tmp >=2)
			{
				carray =1;
				tmp =0;
			}
			else
				carray =0;
			result += char(tmp+'0');
		}
	}	
	reverse(result.begin(),result.end());
	return result;
}