[Codevs 1051] solitaire game (stack)

Title: http://codevs.cn/problem/1051/

Analysis:

Of course, the word search tree can be used, but this is a simpler method. You can first sort by Lexicographic Order, and then get a stack. If the current string can be connected to the back of the top element of the stack, the current string will be added to the stack and updated to ans. Otherwise, the top element of the stack will pop up, knowing that the current string can be followed by the new stack top element.

[Codevs 1051] solitaire game (stack)