To the Top
File:  root - text - article - 2019 - 11 - look-and-say-sequence.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 369 Views, 16098 Search Bots | 77 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Google:

A look-and-say sequence is defined as the integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. An example is easier to understand:

Each consecutive value describes the prior value.


1 #
11 # one 1's
21 # two 1's
1211 # one 2, and one 1.
111221 # #one 1, one 2, and two 1's.


Your task is, return the nth term of this sequence.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 369 Views, 16098 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Question: Find Cycles in a Graph
  2. Floor and Ceiling of a Binary Search Tree
  3. Daily Interview Problem: Largest Product of 3 Elements I
  4. Plus One
  5. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  6. Sorting a list with 3 unique numbers
  7. Fix Brackets
  8. Most Frequent Subtree Sum
  9. Progess made
  10. Patterns for breaking down questions you haven

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