Leetcode 67 —— Add Binary

最新推荐文章于 2024-09-23 00:30:00 发布

原创最新推荐文章于 2024-09-23 00:30:00 发布 · 521 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode —— 字符串系列专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种解决二进制字符串加法的方法，通过逐位相加并处理进位来实现两个二进制字符串的加法运算。

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

Total Accepted: 78879 Total Submissions: 291470 Difficulty: Easy

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

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

Subscribe to see which companies asked this question

Hide Tags

Math String

Hide Similar Problems

(M) Add Two Numbers (M) Multiply Strings (E) Plus One

题意：

计算字符串的加法返回结果字符串。

思路比较简单，注意字符串拼接以及进位的判断。

代码(已AC 2016-03-24)~

string addBinary(string a, string b) {
	if (a.empty() || b.empty())
	{
		return (a.empty()) ? b : a;
	}

	int inc = 0, posA = a.length() - 1, posB = b.length() - 1, sum = 0;
	string res("");
	while (posA >= 0 && posB >= 0)
	{
		sum = (a[posA] - '0') + (b[posB] - '0') + inc;
		inc = sum / 2;

		res = (char)(sum % 2 + '0') + res;

		posA--, posB--;
	}

	while (posA > -1)
	{
		sum = (a[posA] - '0') + inc;
		inc = sum / 2;

		res = (char)(sum % 2 + '0') + res;
		posA--;
	}

	while (posB > -1)
	{
		sum = (a[posB] - '0') + inc;
		inc = sum / 2;

		res = (char)(sum % 2 + '0') + res;
		posB--;
	}

	if (inc)
		res = (char)(inc + '0') + res;

	return res;
}