[Swift]LeetCode294. 翻转游戏之 II $ Flip Game II

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：http://www.javashuo.com/article/p-buzevrts-kv.html 
➤若是连接不是山青咏芝的博客园地址，则多是爬取做者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持做者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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: 
Output: true 
Explanation: The starting player can guarantee a win by flipping the middle  to become .
s = "++++""++""+--+"

Follow up:
Derive your algorithm's runtime complexity.

---

您正在和您的朋友玩如下翻转游戏：给定一个仅包含这两个字符的字符串：+和-，您和您的朋友轮流将两个连续的“++”翻转为“-”。游戏结束时，一我的不能再作一个动做，所以另外一我的将是赢家。

写一个函数来肯定首发球员是否能保证获胜。

例子：

输入：s = "++++"

输出：true

说明：先手玩家能够经过将中间“++”翻转成“+--+”来保证获胜。

跟进：

推导算法的运行时复杂性。

---

Solution:

 1 class Solution {
 2     func canWin(_ s:String) -> Bool {
 3         var arrS:[Character] = Array(s)
 4         for i in 1..<s.count
 5         {
 6             if arrS[i] == "+" && arrS[i - 1] == "+" && !canWin(s.subString(0, i - 1) + "--" + s.subString(i + 1))
 7             {
 8                 return true
 9             }
10         }
11         return false          
12     }
13 }
14 
15 extension String {
16     // 截取字符串：从index到结束处
17     // - Parameter index: 开始索引
18     // - Returns: 子字符串
19     func subString(_ index: Int) -> String {
20         let theIndex = self.index(self.endIndex, offsetBy: index - self.count)
21         return String(self[theIndex..<endIndex])
22     }
23     
24     // 截取字符串：指定索引和字符数
25     // - begin: 开始截取处索引
26     // - count: 截取的字符数量
27     func subString(_ begin:Int,_ count:Int) -> String {
28         let start = self.index(self.startIndex, offsetBy: max(0, begin))
29         let end = self.index(self.startIndex, offsetBy:  min(self.count, begin + count))
30         return String(self[start..<end]) 
31     }
32 }

---

点击：Playground测试

1 var sol = Solution()
2 print(sol.canWin("++++"))
3 //Print true