文件: root - text - article - 2020 - 02 - consecutive-ones.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 434 次阅读, 19935 次搜索 | 52 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 434 次阅读, 19935 次搜索 | 52 个单词
| 浏览 | 博客存档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, | 英文 | 主页 | 类别: 计算机科学 | 434 次阅读, 19935 次搜索 | 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
猜您喜欢...
- Daily Interview Problem: Circle of Chained Words
- Longest Substring Without Repeating Characters
- [Daily Problem] Validate Balanced Parentheses
- Daily Interview Problem: First Missing Positive Integer
- Daily Interview Problem: 3 Sum
- Absolute Path
- Fibonacci coding
- Daily Interview Problem: Largest Product of 3 Elements I
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Daily Interview Problem: Longest Substring With K Distinct Characters
最后更新: October 30 2020 14:21:12 |
©2006~2024 牛排过熟 - 0.01227 秒 - 4396.481 KB/s - 33 在线 
内存: 516.59 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="不索引, 跟踪" />
内存: 516.59 KB18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。