<p>Given two numbers <code>arr1</code> and <code>arr2</code> in base <strong>-2</strong>, return the result of adding them together.</p>

<p>Each number is given in <em>array format</em>:&nbsp; as an array of 0s and 1s, from most significant bit to least significant bit.&nbsp; For example, <code>arr = [1,1,0,1]</code> represents the number <code>(-2)^3&nbsp;+ (-2)^2 + (-2)^0 = -3</code>.&nbsp; A number <code>arr</code> in <em>array, format</em> is also guaranteed to have no leading zeros: either&nbsp;<code>arr == [0]</code> or <code>arr[0] == 1</code>.</p>

<p>Return the result of adding <code>arr1</code> and <code>arr2</code> in the same format: as an array of 0s and 1s with no leading zeros.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arr1 = [1,1,1,1,1], arr2 = [1,0,1]
<strong>Output:</strong> [1,0,0,0,0]
<strong>Explanation: </strong>arr1 represents 11, arr2 represents 5, the output represents 16.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arr1 = [0], arr2 = [0]
<strong>Output:</strong> [0]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> arr1 = [0], arr2 = [1]
<strong>Output:</strong> [1]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= arr1.length,&nbsp;arr2.length &lt;= 1000</code></li>
	<li><code>arr1[i]</code>&nbsp;and <code>arr2[i]</code> are&nbsp;<code>0</code> or <code>1</code></li>
	<li><code>arr1</code> and <code>arr2</code> have no leading zeros</li>
</ul>

class Solution {
public:
    vector<int> addNegabinary(vector<int>& arr1, vector<int>& arr2) {
        int n = std::max(arr1.size(), arr2.size());
        if (arr1.size() < arr2.size()) {
            std::swap(arr1, arr2);
        }
        std::vector<int> res;
        size_t pos = 0;
        for (; pos < n; pos++) {
            if (res.size() == pos) {
                res.push_back(0);
            }
            int tmp;
            if (pos < arr1.size() && pos < arr2.size()) {
                tmp = *(arr1.rbegin() + pos) + *(arr2.rbegin() + pos);
            } else {
                tmp = *(arr1.rbegin() + pos);
            }
            res[pos] += tmp;

            if (res[pos] == 0 || res[pos] == 1) continue;
            assert(res.size() == pos + 1);
            res.push_back(0);

            if (res[pos] < 0) {
                assert(res[pos] == -1);
                res[pos] = 1;
                res[pos + 1]++;
            } else {
                res[pos] %= 2;
                res[pos + 1]--;
            }
        }
        if (res.size() == pos) pos--;
        assert(pos == res.size() - 1);
        while (res[pos] == 0 && pos != 0) {
            res.pop_back();
            pos--;
        }
        if (res[pos] != 0 && res[pos] != 1) {
            if (res[pos] < 0) {
                assert(res[pos] == -1);
                res[pos] = 1;
                res.push_back(1);
            } else {
                res[pos] %= 2;
                res.push_back(1);
                res.push_back(1);
            }
        }
        std::reverse(res.begin(), res.end());
        return res;
    }
};
22500