Search⌘ K
AI Features

Solution: Flip Game

Solution: Flip Game gives you a string of plus and minus signs. Return every distinct state formed by flipping one consecutive pair of plus signs into minus signs, or an empty list if none exists.

Statement

You are playing a Flip Game with a friend.

You are given a string currentState consisting only of the characters '+' and '-'. Players take turns flipping two consecutive "++" into "--". The game ends when a player cannot make a move, at which point the other player wins.

Return all possible states of currentState after performing exactly one valid move. The answer may be returned in any order. If no valid move exists, return an empty list.

Constraints:

  • 1≤1 \leq currentState.length ≤500\leq 500

  • currentState[i] is either '+' or '-'

Solution

The main idea is to generate all possible valid next moves by ...