文件: root - text - article - 2020 - 02 - consecutive-ones.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 615 次阅读, 22187 次搜索 | 52 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 615 次阅读, 22187 次搜索 | 52 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Microsoft:
Return the longest run of 1s for a given integer n's binary representation.
Example:
Input: 242
Output: 4
242 in binary is 0b11110010, so the longest run of 1 is 4.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 615 次阅读, 22187 次搜索 | 52 个单词 Return the longest run of 1s for a given integer n's binary representation.
Example:
Input: 242
Output: 4
242 in binary is 0b11110010, so the longest run of 1 is 4.
def longest_run(n):
# Fill this in.
print longest_run(242)
# 4
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- ImageMagick Vulnerabilities - CVE-2016–3714
- Skip the readings, focus on problems. And use all the hints!
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Daily Interview Question: Create a Simple Calculator
- Daily Interview Problem: Min Range Needed to Sort
- Maximum In A Stack
- [Daily Problem] Witness of The Tall People
- Algorithm Interview: Shifted String
- Spectrum Master
©2006~2024 牛排过熟 - 0.00801 秒 - 7136.793 KB/s - 557 在线
内存: 535.79 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。