Leetcode 476. Number Complement

Given a positive integer, return the integer formed by flipping every bit in its binary representation up to its most significant 1 (i.e., invert all bits excluding leading zeros). This is a bit-manipulation problem—build a mask of 1s covering num's bit-length and xor/negate num against that mask (1 <= num < 2^31).