为什么此python正确输出16位2s补码？

Question

Let binStr be an integer array, and number be the integer to "translate" to binary.

count = len(binStr) - 1
while count >= 0:
      binStr[count] = 0 if number%2 == 0 else 1
      number //= 2
      count -= 1

I wrote this while fiddling around and noticed it works for both signs. Why does this work for both negative and positive numbers? It should yield the same bits for negative and positive, but it actually works correctly and does not. Why?

Answer 1

whoops i misread the question initially...

yeah the core issue is that floor division works differently for positive and negative numbers, as noted above by Ryan