How to optimize this problem?


  • 0
    K
    uint32_t reverseBits(uint32_t n) {
            uint32_t res = 0;
            uint32_t mask = 1;
            for(int i = 0; i < 32; ++i) {
                res = res << 1;
                res += (n & mask);
                n = n >> 1;
            }
            return res;
    }
    

    here are my prue soultion. so how to improve it?


Log in to reply
 

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