[LC] 293. Flip Game

标签：res   next   public   NPU   array   amp   friend   out   ref   

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.

Example:

Input: s = "++++"
Output: 
[
  "--++",
  "+--+",
  "++--"
]

class Solution {
    public List<String> generatePossibleNextMoves(String s) {
        List<String> res = new ArrayList<>();
       for (int i = 0; i < s.length() - 1; i++) {
            if (s.charAt(i) == ‘+‘ && s.charAt(i + 1) == ‘+‘) {
                res.add(s.substring(0, i) + "--" + s.substring(i + 2));
            }
       } 
        return res;
    }
}

[LC] 293. Flip Game

标签：res   next   public   NPU   array   amp   friend   out   ref   

原文地址：https://www.cnblogs.com/xuanlu/p/12128593.html