To the Top
File:  root - text - article - 2020 - 02 - consecutive-ones.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 685 Views, 22982 Search Bots | 52 Words

Subscribe to Feed Burner | Browse | Archive
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
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 685 Views, 22982 Search Bots | 52 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: Permutations of numbers
  2. Find the non-duplicate number
  3. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  4. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  5. Two Tricks of Delphi
  6. Consecutive Ones
  7. Batch Programming in XP
  8. PHP Unit Tests on VPS Server
  9. Daily Interview Problem: Queue Using Two Stacks
  10. Staying on a Chess Board

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />