页面顶部 Top
文件:  root - text - article - 2020 - 02 - consecutive-ones.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 372 次阅读, 18456 次搜索 | 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.


def longest_run(n):
# Fill this in.

print longest_run(242)
# 4
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 372 次阅读, 18456 次搜索 | 52 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Largest BST in a Binary Tree
  2. Fix Brackets
  3. Daily Interview Problem: Tree Serialization
  4. Two Tricks of Delphi
  5. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  6. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  7. Daily Interview Problem: 3 Sum
  8. Absolute Path
  9. Reverse a Directed Graph
  10. Daily Interview Problem: Group Words that are Anagrams

评论 (0)

您的邮件 (不公开域名部分):

您的评论:

悄悄话(发邮件) 颜色 更多笑脸 S x y @

验证码 (点击图片更新):

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />