原題鏈接在這里：https://leetcode.com/problems/flip-game/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 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?[].

題解：

若是連著的"++", 就把這段用"--"替代放到res中.

Note: 當i == s.length()-1走到最后一位時. s.substring(i+1), 不會out of index, 會返回"". 但再大就不行了.

Time Complexity: O(n). Space: O(1) regardless res.

AC Java:

1 public class Solution { 2 public List<String> generatePossibleNextMoves(String s) { 3 List<String> res = new ArrayList<String>(); 4 for(int i = 1; i<s.length(); i++){ 5 if(s.charAt(i) == '+' && s.charAt(i-1) == '+'){ 6 res.add(s.substring(0,i-1) + "--" + s.substring(i+1)); 7 } 8 } 9 return res; 10 } 11 }

?跟上Flip Game II

轉載于:https://www.cnblogs.com/Dylan-Java-NYC/p/5186278.html

總結

以上是生活随笔為你收集整理的LeetCode 293. Flip Game的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。