Flip Game II

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 determine if the starting player can guarantee a win.

For example, given s = "++++", return true. The starting player can guarantee a win by flipping the middle "++" to become "+--+".

Follow up:
Derive your algorithm's runtime complexity.

思路：这题其实是递归的最好考题，想想怎么判断才能赢，就是自己move了之后，对方不能move，也就是调用相同的函数，对方返回如果是false，那我就应该是true。

public class Solution {
    public boolean canWin(String s) {
        if(s == null || s.length() <2){
            return false;
        }
        return win(s.toCharArray());
    }
    
    public boolean win(char[] chars){
        boolean canwin = false;
        for(int i=0; i<chars.length-1; i++){
            if(chars[i] == '+' && chars[i+1] == '+'){
                chars[i] = '-';
                chars[i+1] = '-';
                canwin = !win(chars);
                chars[i+1] = '+';
                chars[i] = '+';
                if(canwin){
                    return true;
                }
            }
        }
        return canwin;
    }
}