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

猜您喜欢...

  1. Consecutive Ones
  2. A trick for getting good at coding interviews FASTER
  3. Daily Interview Problem: Jump to the End
  4. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  5. Daily Interview Problem: Circle of Chained Words
  6. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  7. How to Play WAV music under DOS?
  8. Daily Interview Problem: Look and Say Sequence
  9. Making a Height Balanced Binary Search Tree
  10. Non-decreasing Array with Single Modification

评论 (0)

    当前页暂时没有评论。


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