Leetcode 201. Bitwise AND of Numbers Range

已于 2022-12-25 18:00:05 修改
阅读量101 收藏
点赞数
分类专栏： Leetcode 解题报告 入门题 文章标签： leetcode 算法 职场和发展
于 2022-12-25 17:56:37 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/mobius_strip/article/details/128436759
版权
解题报告 同时被 3 个专栏收录
1365 篇文章 4 订阅
订阅专栏
入门题
291 篇文章 2 订阅
订阅专栏
Leetcode
146 篇文章 0 订阅
订阅专栏

Problem

Given two integers left and right that represent the range [left, right], return the bitwise AND of all numbers in this range, inclusive.

Algorithm

Determine whether each 1 will become 0. Use the power of 2 to turn the 1 of left to 0, if the sum is no more than right, the number is in the range and do AND.

Code

class Solution:
    def rangeBitwiseAnd(self, left: int, right: int) -> int:
        ans = left & right
        base = 1
        bits = 0
        while base <= right:
            if base & left and base + left <= right:
                ans &= base + left
            base *= 2
        
        return ans
小白菜又菜
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
LeetCode 201. Bitwise AND of Numbers Range
MrJustin的博客
04-24 192
[Med] LeetCode 201. Bitwise AND of Numbers Range 链接: https://leetcode.com/problems/bitwise-and-of-numbers-range/ 题目描述： Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwis...
LeetCode201. Bitwise AND of Numbers Range
叶卡捷琳堡的博客
12-18 365
【代码】LeetCode201. Bitwise AND of Numbers Range。
python leetcode 201. Bitwise AND of Numbers Range
Neekity的博客
12-16 497
涉及到位操作的题想想能不能用mask做。只要某一位上出现过0那么这一位就置0。 先考虑最低位，第‘0位’，想想是不是只要m不等于n，那么肯定出现过0。 接下来考虑第‘1位’，想想我们第‘0位’是怎么做的。m!=n &lt;-&gt; (m&amp;mask) != (n&amp;mask)，mask=2**31-1. 现在将第‘1位’当做第‘0位’来做，mask左移一位。 第‘2位’，mask...
201. Bitwise AND of Numbers Range
God_Mood的博客
06-07 180
题目链接：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. Exampl...
LeetCode | 201. Bitwise AND of Numbers Range
iLOVEJohnny的博客
11-30 131
题目： 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 代码： class Solution { public: int ran...
LeetCode 201. Bitwise And of Numbers Range
脚踏实地，仰望星空
03-07 160
题目链接：点击这里 题意：给定范围 [m, n]，其中 0 <= m <= n <= 2147483647，返回此范围内所有数字的按位与（包含 m, n 两端点）。 数据范围 [0,2147483647][0,2147483647][0,2147483647]，暴力 O(n)O(n)O(n) 超时。 思路：有一个 000 与运算的结果就是 000。此题其实就是寻找 [m,n][...
[WXM] LeetCode 201. Bitwise AND of Numbers Range C++
WXM
09-04 208
201. Bitwise AND of Numbers Range Given a range [m, n] where 0 &amp;amp;amp;lt;= m &amp;amp;amp;lt;= n &amp;amp;amp;lt;= 2147483647, return the bitwise AND of all numbers in this range, inclusive. Example 1: Input: [5,7] Output: 4 ...
leetcode 201.Bitwise AND of Numbers Range
weixin_30425949的博客
09-12 77
要求求出在一个序列中的所有数字的二进制的和，那么会发现左边相与相等即可的，则可以利用最大值的不断右移来实现的。 class Solution { public: int rangeBitwiseAnd(int m, int n) { int t=INT_MAX; while((m&t)!=(n&t)){ ...
leetcode201. Bitwise AND of Numbers Range
weixin_33895657的博客
02-04 86
题目要求 Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. For example, given the range [5, 7], ...
Leetcode 数字范围按位与.pas
最新发布
02-21
LeetCode 201的题目是"数字范围按位与"（Bitwise AND of Numbers Range），其核心要求是给定两个整数（记为m和n），需要找出这两个数范围内所有数的按位与（bitwise AND）结果。例如，给定范围[5, 7]，结果应为4。 ...
leetcode笔记：Bitwise AND of Numbers Range
liyuefeilong的专栏
03-04 1435
给定一个范围[m, n]，其中 0 <= m <= n <= 2147483647，返回范围内所有整数的按位与，包括边界m和n。比如给定范围为[5, 7], 应返回4。单看题目描述，可以知道该题涉及到位运算。
【LeetCode】006 Bitwise AND of Numbers Range 区间内整数按位与
王二狗的博客
03-01 569
【题目】 Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4.  令0 【解析】 思路一：循环 ​​程序如下： int rangeBitwiseAnd(int m, int n) {     while(m     n &
leetcode 201 数字范围按位与 位操作解法
weixin_48629601的博客
08-23 224
题目 给定范围 [m, n]，其中 0 <= m <= n <= 2147483647，返回此范围内所有数字的按位与（包含 m, n 两端点）。 示例 1: 输入: [5,7] 输出: 4 示例 2: 输入: [0,1] 输出: 0 来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/bitwise-and-of-numbers-range 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。 解题思路 按位与，简单的
Leetcode 137. Single Number II
小白菜又菜
01-26 5854
Problem Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space.
Leetcode 134. Gas Station
小白菜又菜
01-25 4597
Problem There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the
Leetcode 135. Candy
小白菜又菜
01-25 3727
Problem There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings. You are giving candies to these children subjected to the following requirements: Each child must have at least one candy. Children w
Leetcode 126. Word Ladder II
小白菜又菜
11-28 3476
Problem A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> … -> sk such that: Every adjacent pair of words differs by a single letter. Every si for 1 <= i
Leetcode 136. Single Number
小白菜又菜
01-25 3073
Problem Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Algorithm Sort the array and then scan for
leetcode 204.计数质数 python
09-06
你可以使用埃拉托斯特尼筛法（Sieve of Eratosthenes）来解决LeetCode 204题，计数质数问题。下面是使用Python的实现示例代码： ```python class Solution: def countPrimes(self, n: int) -> int: if n < 2: return 0 # 初始化标记数组，默认所有数都是质数 is_prime = [1] * n is_prime[0] = is_prime[1] = 0 # 埃氏筛法 for i in range(2, int(n ** 0.5) + 1): if is_prime[i]: # 将i的倍数标记为合数 is_prime[i*i:n:i] = [0] * len(is_prime[i*i:n:i]) # 统计质数的个数 return sum(is_prime) ``` 这段代码中，我们首先初始化一个长度为n的标记数组is_prime，用于表示每个数字是否为质数（1表示质数，0表示合数）。然后从2开始遍历到根号n，对于每个质数i，将其所有的倍数标记为合数。最后，统计标记数组中值为1的个数，即为质数的个数。 你可以将以上代码复制到LeetCode上进行测试。希望能对你有所帮助！
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值