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 [].
public class Solution { public List generatePossibleNextMoves(String s) { List result = new ArrayList(); for(int i=1;i This siteOriginal articleAll follow "Attribution-NonCommercial-ShareAlike 4.0 License (CC BY-NC-SA 4.0)Please retain the following annotations when sharing or adapting:
Original author:Jake Tao,source:「LeetCode – 293. Flip Game」
