To the Top
File:  root - text - article - 2019 - 11 - falling-dominoes.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 486 Views, 15250 Search Bots | 117 Words

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

Given a string with the initial condition of dominoes, where:

. represents that the domino is standing still
L represents that the domino is falling to the left side
R represents that the domino is falling to the right side

Figure out the final position of the dominoes. If there are dominoes that get pushed on both ends, the force cancels out and that domino remains upright.

Example:
Input: ..R...L..R.
Output: ..RR.LL..RR
Here is your starting point:


class Solution(object):
def pushDominoes(self, dominoes):
# Fill this in.

print Solution().pushDominoes('..R...L..R.')
# ..RR.LL..RR
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Cateogry: Computing | 486 Views, 15250 Search Bots | 117 Words Subscribe to Feed Burner

Related Articles

  1. Spreadsheet Columns
  2. Daily Interview Puzzle: Minimum Size Subarray Sum
  3. Daily Interview Problem: Merge List Of Number Into Ranges
  4. Daily Interview Problem: Group Words that are Anagrams
  5. Daily Interview Problem: Largest BST in a Binary Tree
  6. [Daily Problem] Add two numbers as a linked list
  7. Longest Substring Without Repeating Characters
  8. Daily Interview Puzzle: Ways to Traverse a Grid
  9. Print a tree level-by-level, with line-breaks
  10. Daily Interview Problem: First Missing Positive Integer

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