NC1 大数加法

class Solution {
public:
string solve(string s, string t) {
auto preprocess = [](string& s, string& t) -> void
{
if (s.empty()) s = "0";
if (t.empty()) t = "0";
if (s.size() < t.size())
{
string tmp;
tmp.swap(s);
tmp.swap(t);
s.swap(tmp);
}
s = "0" + s;
};
auto process = [](string& s, string& t)
{
constexpr uint32_t kCharZero = '0';
constexpr uint32_t kCharTen = '9' + 1;
string& res = s;
size_t maxLoopTime = t.size(), sSize = s.size(), tSize = t.size();
for (int i = 0; i<maxLoopTime; i++)
{
res[sSize - i -1] = s[sSize - i -1] + t[tSize -i -1] - kCharZero;
if (res[sSize - i -1] >= kCharTen)
{
res[sSize - i -1] -= 10;
res[sSize - i -2] += 1;
}
}
maxLoopTime = s.size() - 1;
for (int i =0; i<maxLoopTime; i++)
{
if (res[sSize - i -1] >= kCharTen)
{
res[sSize - i -1] -= 10;
res[sSize - i -2] += 1;
}
}
};
auto postprocess = [](string& s)
{
if (!s.empty() && s[0]=='0')
{
s = s.substr(1, s.size()-1);
}
};
preprocess(s, t);
process(s, t);
postprocess(s);
return s;
}
};
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72