文件: root - text - article - 2019 - 11 - falling-dominoes.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 492 次阅读, 15956 次搜索 | 117 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 492 次阅读, 15956 次搜索 | 117 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
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:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | 英文 | 主页 | 类别: 计算机科学 | 492 次阅读, 15956 次搜索 | 117 个单词 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
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- Daily Interview Puzzle: Falling Dominoes
- Daily Interview Problem: First Missing Positive Integer
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- Daily Interview Question: Find Cycles in a Graph
- [Daily Problem] Longest Increasing Subsequence
- [Daily Problem] Course Prerequisites
- Daily Interview Puzzle: Ways to Traverse a Grid
- Algorithm Interview Question: Max and Min with Limited Comparisons
- Daily Interview Problem: Find the Number of Islands
- Daily Interview Problem: Min Stack
©2006~2024 牛排过熟 - 0.01101 秒 - 1809.753 KB/s - 37 在线
内存: 495.22 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="索引, 跟踪">
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。