[LeetCode294] Flip Game II

32 篇文章 0 订阅

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 twoconsecutive "++" 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.

For example, given s = "++++", return true. The starting player can guarantee a win by flipping the middle "++" to become "+--+".


class Solution {
public:
	bool firstPlayWinning(string s) {
		return canWin(s);
	}

	bool canWin(string& s) {
		for(int i=0;i<s.size()-1;i++) {
			if(s[i]==s[i+1]&&s[i]=='+') {
				s[i]=s[i+1]='-';
				bool win=!canWin(s);
				s[i]=s[i+1]='+';
				if(win) return true;
			}
		}
		return false;
	}
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值