[Leetcode] 293. Flip Game 解题报告
来源:互联网 发布:手机自动关闭数据连接 编辑:程序博客网 时间:2024/06/05 18:15
题目:
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 []
.
思路:
很简单的一道题目,没有什么可讲的。估计follow up在后面。
代码:
class Solution {public: vector<string> generatePossibleNextMoves(string s) { vector<string> ret; if (s.length() <= 1) { return ret; } for (int i = 0; i < s.length() - 1; ++i) { if (s[i] == '+' && s[i + 1] == '+') { ret.push_back(s); ret.back()[i] = ret.back()[i + 1] = '-'; } } return ret; }};
阅读全文
0 0
- [leetcode] 293. Flip Game 解题报告
- [Leetcode] 293. Flip Game 解题报告
- [leetcode] 294. Flip Game II 解题报告
- [Leetcode] 294. Flip Game II 解题报告
- poj1753 Flip Game 解题报告
- poj1753:Flip Game解题报告
- LeetCode 293. Flip Game
- Leetcode Everyday: 293. Flip Game
- Leetcode Jump Game 解题报告
- 【LeetCode】Jump Game 解题报告
- LeetCode 解题报告 Dungeon Game
- leetcode [Nim game解题报告]
- [LeetCode] Jump Game 解题报告
- 【LeetCode】Nim Game 解题报告
- POJ 1753 Flip Game 解题报告(高斯消元法)
- 解题报告:POJ 1753 Flip Game 简单深搜dfs
- POJ 1753 Flip Game (状态压缩+BFS) -- 解题报告
- Leetcode 293. Flip Game & 294. Flip Game II
- Java常识 ------分支语句(for do---while while语句)
- ConstraintLayout属性详解和Chain的使用
- JvavScript与java中的正则表达式的区别
- JS设置cookie、读取cookie、删除cookie
- C# 获取CPU ID(本机)
- [Leetcode] 293. Flip Game 解题报告
- 文章标题
- 深度学习在目标跟踪中的应用
- tensorflow 变量生成 变量管理 tf.Variable & tf.get_variable & tf.variable_scope
- 解决IP匹配查询的方案
- Java List<Object>去掉重复对象
- 如何直接运行py文件
- 【排序算法】快速排序
- centOS windows 双系统时间设置