见笑了，很简单，可以看看么

-1110101111的原码补码反码怎么求？还有-0.11111101

5 取反 等于 -6
基本就是 -（n+1）

求这个那个码的看

Bitmask (Bit Manipulation) - VisuAlgo Bitmask provide an efficient way to manipulate a small set of Booleans that is stored as a 32-(or 64-)bit signed integer in base-10 but interpreted as a short 32-(or 64-)bit string.By using bitwise operations, each bit of the integer can be checked, turned on (or turned off) easily and quickly. It can be used in various algorithms such as the Dynamic Programming solution for Travelling Salesman Problem to speed up crucial (small) set-based operations.Click 'Next' (on the top right)/press 'Page Down' to advance this e-Lecture slide, use the drop down list/press 'Space' to jump to a specific slide, or Click 'X' (on the bottom right)/press 'Esc' to go to Exploration mode. https://visualgo.net/en/bitmask

正数，转为二进制后符号位为零，正数的原码反码补码都是不变的，即转换后的二进制数。负数，转换后最高位符号位为1，先求反码，就是除符号位，每一位求反，也就是一变成0，0变成一，这样求出来的基础上，给当前反码加1就是负数的补码