Java 0ms, No bitwise, Easy to understand
```\npublic int findComplement(int num) {\n\n\tint i = 0;\n\tint res = 0;\n\t\n\twhile (num > 0) {\n\t\n\t\tif (num % 2 == 0)\n\t\t\tres += Math.pow(2, i);\n\t\
```\npublic int findComplement(int num) {\n\n\tint i = 0;\n\tint res = 0;\n\t\n\twhile (num > 0) {\n\t\n\t\tif (num % 2 == 0)\n\t\t\tres += Math.pow(2, i);\n\t\ti++;\n\t\tnum /= 2;\n\t}\n\treturn res;\n}\n\t
[]