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

Related Articles

  1. Daily Interview Problem: Buddy Strings
  2. Daily Interview Problem: Merge Overlapping Intervals
  3. Daily Interview Problem: Distribute Bonuses
  4. Daily Interview Problem: Min Range Needed to Sort
  5. Algorithm Interview Question: Symmetric k-ary Tree
  6. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  7. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  8. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  9. Algorithm Interview: No Adjacent Repeating Characters
  10. Consecutive Ones

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="index, follow">