4-line python clear solution with explanation
for each number, we first consider its binary mode, then we check 10,1000,100000,... one by one\nfor example, 6 = \'110\', so for the second \'1\',  in base -2,
for each number, we first consider its binary mode, then we check 10,1000,100000,... one by one\nfor example, 6 = \'110\', so for the second \'1\',  in base -2, it makes the initial number decrease `4(+2 -> -2)`\nso we jusr make the initial number add 4, then 6 -> 10 = \'1010\', later we consider the first \'1\', it makes the initial number decrease `16(+8 -> -8)`, then we add 16, 10 -> 26 = \'11010\', now we get the answer.\n\n```python\nclass Solution:\n    def baseNeg2(self, N: int) -> str:\n        neg = [1 << i for i in range(1, 33, 2)]\n        for mask in neg:\n            if N & mask: N += mask*2\n        return bin(N)[2:]\n```
[]