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

Related Articles

  1. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  2. Algorithm Interview: Maximum Path Sum in Binary Tree
  3. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  4. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  5. Spectrum Master
  6. Daily Interview Problem: Validate Binary Search Tree
  7. Skip the readings, focus on problems. And use all the hints!
  8. Daily Interview Problem: Arithmetic Binary Tree
  9. Print a tree level-by-level, with line-breaks
  10. Two Tricks of Delphi

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="index, follow">