LeetCode-476. Number Complement
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
public class Solution { public int findComplement(int num) { return ~num & ((Integer.highestOneBit(num)<<1) - 1); } }
作者:Pickle
声明:对于转载分享我是没有意见的,出于对博客园社区和作者的尊重一定要保留原文地址哈。
致读者:坚持写博客不容易,写高质量博客更难,我也在不断的学习和进步,希望和所有同路人一道用技术来改变生活。觉得有点用就点个赞哈。







