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 | 373 Views, 16603 Search Bots | 77 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 373 Views, 16603 Search Bots | 77 Words
| 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.
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 | 373 Views, 16603 Search Bots | 77 Words 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.
Related Articles
- Daily Interview Problem: Largest BST in a Binary Tree
- Windows Scripting
- Daily Interview Problem: Deepest Node in a Binary Tree
- Daily Interview Problem: Find the Number of Islands
- Top K Frequent words
- Detect Linked List Cycle
- Daily Interview Question: Word Search
- Binary Tree Level with Minimum Sum
- Design Tic-Tac-Toe
- First and Last Indices of an Element in a Sorted Array
©2006~2024 SteakOverCooked - 0.01467 Seconds(s) - 3211.825 KB/s - 26 Online Memory: 538.71 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !