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 | 493 Views, 16362 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 | 493 Views, 16362 Search Bots | 117 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: Subarray With Target Sum
  2. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  3. Reverse a Linked List
  4. Daily Interview Problem: Group Words that are Anagrams
  5. Two Tricks of Delphi
  6. Daily Interview Problem: Room scheduling
  7. [Daily Problem] Add two numbers as a linked list
  8. Algorithm Interview Question: Symmetric k-ary Tree
  9. Making a Height Balanced Binary Search Tree
  10. Daily Interview Question: Longest Sequence with Two Unique Numbers

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