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 | 435 Views, 20282 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 | 435 Views, 20282 Search Bots | 52 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview Question: Symmetric k-ary Tree
  2. Floor and Ceiling of a Binary Search Tree
  3. ImageMagick Vulnerabilities -  CVE-2016–3714
  4. Reverse a Linked List
  5. Daily Interview Problem: Validate Binary Search Tree
  6. Delphi Dynamic Array
  7. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  8. Daily Interview Problem: Group Words that are Anagrams
  9. Spectrum Master
  10. Daily Interview Problem: Room scheduling

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" />