当前位置:网站首页>Leetcode 294. Flip game II (game theory)
Leetcode 294. Flip game II (game theory)
2022-07-03 00:39:00 【ccsu_ deer】
【 Title Description 】
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 determine if the starting player can guarantee a win.
Example:
Input:
- 1.
s = "++++"
- 1.
Output: true
Explanation: The starting player can guarantee a win by flipping the middle
- 1.
- 2.
"++"
- 1.
to become
- 1.
"+--+"
- 1.
.
- 1.
Follow up:
Derive your algorithm's runtime complexity.practice : The question was LC Lock the , You must be a member to watch , I use it here. C++ Let's do it . Combined with the last article : Blog
The solution to this problem is the current string If you reverse These two are continuous ++ Then the remaining state is If you are in a state of failure , This state is the winning state .
that dfs Just a second . What hurts is This question doesn't say the length of the string , So I dare not dfs Violent writing . After reading the solution, it is dfs Dare to write so .
#include<bits/stdc++.h>
using namespace std;
const int N=1e2+10;
string s;
int run(string s)
{
//cout<<s<<endl;
for(int i=0;i<s.size();++i){
if(i+1<s.size()&&s[i]=='+'&&s[i+1]=='+'
&&!run(s.substr(0,i)+s.substr(i+2))) return 1;
}
return 0;
}
int main()
{
cin>>s;
if(run(s)) printf("First");
else puts("Second");
return 0;
}
/*
1100
*/
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
边栏推荐
- NC50528 滑动窗口
- Markdown使用教程
- [shutter] image component (load network pictures | load static pictures | load local pictures | path | provider plug-in)
- Linux Software: how to install redis service
- antv x6节点拖拽到画布上后的回调事件(踩大坑记录)
- Why is the website slow to open?
- Callback event after the antv X6 node is dragged onto the canvas (stepping on a big hole record)
- pageoffice-之bug修改之旅
- Seckill system design
- 关于XML一些介绍和注意事项
猜你喜欢

Shell 实现文件基本操作(切割、排序、去重)

Introduction of UART, RS232, RS485, I2C and SPI

Two common methods and steps of character device registration

University of Toronto:Anthony Coache | 深度强化学习的条件可诱导动态风险度量

MySQL 23道经典面试吊打面试官

One of the reasons why setinterval timer does not take effect in ie: the callback is the arrow function

Cmake basic use

Shell 实现文件基本操作(sed-编辑、awk-匹配)

Callback event after the antv X6 node is dragged onto the canvas (stepping on a big hole record)

Multiprocess programming (I): basic concepts
随机推荐
[shutter] image component (load network pictures | load static pictures | load local pictures | path | provider plug-in)
LeedCode1480.一维数组的动态和
[target detection] r-cnn, fast r-cnn, fast r-cnn learning
Is there a specific format for English papers?
NC50528 滑动窗口
Shell implements basic file operations (cutting, sorting, and de duplication)
Automated defect analysis in electron microscopic images-论文阅读笔记
Maya fishing house modeling
线程的启动与优先级
Vulkan-性能及精细化
Bypass AV with golang
FRP reverse proxy +msf get shell
Nacos+openfeign error reporting solution
Shell 实现文件基本操作(sed-编辑、awk-匹配)
Thinkadmin V6 arbitrary file read vulnerability (cve-2020-25540)
Implement the foreach method of array
AcWing_ 188. Warrior cattle_ bfs
LeedCode1480. Dynamic sum of one-dimensional array
毕业总结
mm中的GAN模型架构