Flip Game

作者: BLUE_fdf9 | 来源:发表于2018-11-13 11:12 被阅读0次

题目
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.

答案

class Solution {
    public List<String> generatePossibleNextMoves(String s) {
        List<String> list = new ArrayList<>();
        char[] ss = s.toCharArray();
        for(int i = 0; i < s.length(); i++) {
            // Replace current '++' with '--'
            if(s.charAt(i) == '+' && (i+1 < s.length() && s.charAt(i+1) == '+')) {
                String str = s.substring(0, i) + "--" + s.substring(i + 2);
                list.add(str);
            }
        }
        return list;
    }
}

相关文章

网友评论

      本文标题:Flip Game

      本文链接:https://www.haomeiwen.com/subject/hjmkfqtx.html