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

Related Articles

  1. Daily Interview Puzzle: Intersection of Linked Lists
  2. First and Last Indices of an Element in a Sorted Array
  3. Algorithm Interview: Maximum Path Sum in Binary Tree
  4. Algorithm Interview Question: Symmetric k-ary Tree
  5. Longest Substring Without Repeating Characters
  6. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  7. Making a Height Balanced Binary Search Tree
  8. Daily Interview Problem: Merge List Of Number Into Ranges
  9. Algorithm Interview: Convert Roman Numerals to Decimal
  10. Daily Interview Puzzle: Ways to Traverse a Grid

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