LeetCode 293. Flip Game（反转游戏）

原题网址：https://leetcode.com/problems/flip-game/

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 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 [].

方法：直接扫描，时间复杂度O(n)

public class Solution {    public List<String> generatePossibleNextMoves(String s) {        List<String> results = new ArrayList<>();        char[] sa = s.toCharArray();        for(int i=0; i<sa.length-1; i++) {            if (sa[i]=='+' && sa[i+1]=='+') {                sa[i]='-';                sa[i+1]='-';                results.add(new String(sa));                sa[i]='+';                sa[i+1]='+';            }        }        return results;    }}