Leetcode: Flip Game
来源:互联网 发布:python 常用设计模式 编辑:程序博客网 时间:2024/05/29 17:59
Question
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 [].
Hide Company Tags Google
Hide Tags String
Hide Similar Problems (M) Flip Game II
My Solution
Accept
Time Complexity:
Time: 44ms
class Solution(object): def generatePossibleNextMoves(self, s): """ :type s: str :rtype: List[str] """ res = [] if len(s)<2 or (len(s)==2 and s[0]!=s[1]): return res for ind in range(len(s)-1): if s[ind]=="-" or s[ind+1]!=s[ind]: continue res.append( s[0:ind] + "--" + s[ind+2:] ) return res
0 0
- [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
- LeetCode 题解(276) :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 题解(277) :Flip Game II
- [leetcode] 293. Flip Game 解题报告
- [leetcode] 294. Flip Game II 解题报告
- LeetCode 293. Flip Game(反转游戏)
- Leetcode 293. Flip Game (Easy) (cpp)
- appcache 缓存
- iOS输入框怎样避免键盘的遮挡
- IIS——服务器上部署网站及遇到的问题图解(二)
- web测试需了解的知识
- Java深入(高新技术)(八):代理技术AOP
- Leetcode: Flip Game
- .NET 开源开发项目【翻译】
- PE总结16--PE结构图和PE结构
- elasticsearch那几个坑
- ContentProvider基本知识了解与扩展整理
- java集合架构详解
- MJRefresh简单用法
- String.hascode()
- 二、Topology的并行度