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

Related Articles

  1. Plus One
  2. Daily Interview Problem: Largest Product of 3 Elements I
  3. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  4. Daily Interview Problem: Room scheduling
  5. A trick for getting good at coding interviews FASTER
  6. Batch Programming in XP
  7. Algorithm Interview: Permutations of numbers
  8. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  9. Binary Tree Level with Minimum Sum
  10. Daily Interview Problem: Find the k-th Largest Element in a List

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