LeetCode 题解(276) :Flip Game
来源:互联网 发布:添加字段sql 编辑:程序博客网 时间:2024/06/05 20:39
题目:
You are playing the following Flip Game with your friend: Given a string that contains only these two characters:+
and -
, you and your friend take turns to flip two consecutive "++"
into "--"
. The game ends when a person can no longer make a move and therefore the other person will be the winner.
Write a function to compute all possible states of the string after one valid move.
For example, given s = "++++"
, after one move, it may become one of the following states:
[ "--++", "+--+", "++--"]
If there is no valid move, return an empty list []
.
class Solution(object): def generatePossibleNextMoves(self, s): """ :type s: str :rtype: List[str] """ result = [] for i in range(len(s) - 1): if s[i] == '+' and s[i+1] == '+': result.append(s[:i] + "--" + s[i+2:]) return result
0 0
- LeetCode 题解(276) :Flip Game
- LeetCode 题解(277) :Flip Game II
- poj1753 flip game题解
- [LeetCode 293] Flip Game
- *LeetCode-Flip Game II
- [leetcode 293] Flip Game
- Leetcode 293: Flip Game
- Leetcode: Flip Game
- [LeetCode 293] Flip Game
- LeetCode 293. Flip Game
- zoj 2050 -Flip Game题解
- Leetcode NO.293 Flip Game
- Leetcode Everyday: 293. Flip Game
- 【Leetcode】 Flip Game 翻转游戏
- LeetCode 294. Flip Game II
- Leetcode 293. Flip Game & 294. Flip Game II
- LeetCode题解:Jump Game
- LeetCode题解:Nim Game
- 算法实习生之路——根据需求修改UCB算法,测试UCB算法特性
- 算法实习生之路——基于Json串的UCB算法加载性能测试
- Amazon OA2准备——最大公约数
- Spring - MVC Framework 教程
- LeetCode 题解(275) : Nim Game
- LeetCode 题解(276) :Flip Game
- LeetCode 题解(277) :Flip Game II
- IOS消息推送之APNS
- 小团队 机器学习
- 用R&Python在云端运行可扩展数据科学
- 易开发创始人潘俊勇:这些年我遇到的那些坑
- ThoughtWorks面试失败
- 20151018
- 黑马程序员——Java多态