Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public class Solution { public int findComplement(int num) { int n = (int)(Math.log(num) / Math.log(2)) + 1; return (int)(Math.pow(2, n) - 1) - num; } }

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.