当前位置:网站首页>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.
边栏推荐
- Vulkan-性能及精细化
- Andorid 获取系统标题栏高度
- Pytorch 20 realizes corrosion expansion based on pytorch
- [shutter] image component (load network pictures | load static pictures | load local pictures | path | provider plug-in)
- Callback event after the antv X6 node is dragged onto the canvas (stepping on a big hole record)
- Array de duplication
- Where can I check the foreign literature of economics?
- 简单聊聊运维监控的其他用途
- 免费自媒体必备工具分享
- MySQL 23 classic interview hanging interviewer
猜你喜欢

Shell脚本基本使用

Use Jenkins II job

Why is the website slow to open?

Shell 实现文件基本操作(切割、排序、去重)
![Luogu_ P2010 [noip2016 popularization group] reply date_ Half enumeration](/img/a3/55bb71d39801ceeee421a0c8ded333.png)
Luogu_ P2010 [noip2016 popularization group] reply date_ Half enumeration

百数不断创新,打造自由的低代码办公工具

Gan model architecture in mm

Linux Software: how to install redis service
![[shutter] image component (the placeholder | transparent_image transparent image plug-in is loaded into the memory)](/img/73/19e2e0fc5ea6f05e34584ba40a452d.jpg)
[shutter] image component (the placeholder | transparent_image transparent image plug-in is loaded into the memory)

Feature Engineering: summary of common feature transformation methods
随机推荐
Multiprocess programming (I): basic concepts
Some introduction and precautions about XML
免费自媒体必备工具分享
FAQ | FAQ for building applications for large screen devices
文件操作IO-Part2
Rust所有权(非常重要)
Basic 10 of C language: array and pointer
Automated defect analysis in electronic microscopic images
pageoffice-之bug修改之旅
【luogu P4320】道路相遇(圆方树)
Pat 1030 travel plan (30 points) (unfinished)
Bloom filter
[MCU project training] eight way answering machine
Introduction and use of ftrace tool
【单片机项目实训】八路抢答器
node_ Modules cannot be deleted
About the practice topic of screen related to unity screen, unity moves around a certain point inside
[shutter] image component (image component introduction | image constructor | image.network constructor | image.asset constructor)
如何系统学习机器学习
Implement the foreach method of array