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 | 365 Views, 15478 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 | 365 Views, 15478 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Two Tricks of Delphi
  2. Algorithm Interview Question: Max and Min with Limited Comparisons
  3. [Daily Problem] Add two numbers as a linked list
  4. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  5. Daily Interview Problem: Group Words that are Anagrams
  6. Number of Ways to Climb Stairs
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. Delphi Dynamic Array
  9. Algorithm Interview Question: Symmetric k-ary Tree
  10. Daily Interview Problem: Given two arrays, write a function to compute their intersection.

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