Leetcode - Binary Tree Longest Consecutive Sequence
Leetcode - Boundary of Binary Tree

Leetcode - Bitwise AND of Numbers Range

violet posted @ Apr 24, 2020 01:29:45 AM in 算法 with tags Algorithm Golang BitManipulation , 207 阅读

https://leetcode.com/problems/bitwise-and-of-numbers-range/

Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.

Example 1:

Input: [5,7]
Output: 4

Example 2:

Input: [0,1]
Output: 0

 

func rangeBitwiseAnd(m int, n int) int {
    shift := 0
    for m < n{
        m >>= 1
        n >>= 1
        shift++
    }
    
    return m << shift
}

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter