页面顶部 Top
文件:  root - text - article - 2019 - 11 - falling-dominoes.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 484 次阅读, 15184 次搜索 | 117 个单词

定阅此目录的博客 | 浏览 | 博客存档
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
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 484 次阅读, 15184 次搜索 | 117 个单词 定阅此目录的博客

猜您喜欢...

  1. ImageMagick Vulnerabilities -  CVE-2016–3714
  2. Reverse a Directed Graph
  3. Daily Interview Problem: Circle of Chained Words
  4. Daily Interview Puzzle: Ways to Traverse a Grid
  5. Spectrum Master
  6. Algorithm Interview: Determine If Linked List is Palindrome
  7. Algorithm Interview: Permutations of numbers
  8. Number of Ways to Climb Stairs
  9. Daily Interview Problem: Find the Number of Islands
  10. Algorithm Interview: String Compression

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />