Leetcode 67: Add Binary-优快云博客

本文介绍了一种处理二进制字符串加法的方法。通过逐位相加的方式实现了不同长度二进制字符串的加法运算，并考虑了进位的情况。适用于处理大数运算等问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//字符串的输入可能会是比较大的数组，需要用字符串逐位相加

class Solution {
public:
    string addBinary(string a, string b) {
	string result = "";
	int max_length = a.length() > b.length() ? a.length() : b.length();
	int min_length = a.length() < b.length() ? a.length() : b.length();
	int index;
	char temp = '0';
	if (a.length() > b.length())
		for (int i = 0; i<max_length - min_length; i++)
			b = '0' + b;
	else if (a.length() < b.length())
		for (int i = 0; i<max_length - min_length; i++)
			a = '0' + a;

	for (index = 1; index <= max_length; index++)
	{
		cout << a[a.length() - index] << ' ' << b[b.length() - index] << endl;
		if (a[a.length() - index] == b[b.length() - index] && b[b.length() - index] == '1')
		{
			if (temp == '1')
				result = '1' + result;
			else
				result = '0' + result;
			temp = '1';
		}
		else if (a[a.length() - index] == b[b.length() - index] && b[b.length() - index] == '0')
		{
			if (temp == '1')
				result = '1' + result;
			else
				result = '0' + result;
			temp = '0';
		}
		else
		{
			if (temp == '1')
				result = '0' + result;
			else
				result = '1' + result;
		}
	}
	if (temp == '1')
		result = '1' + result;
	return result;
    }
};