Java implementation of耐心的命运

This class is a Java implementation of patience sort. It currently uses a String argument to the processString method and returns a String of the longest increasing subsequence. using Char as the comparison procedure. The class uses Stacks of Stacks and implements the greedy strategy. Patience sorting is a sorting algorithm that yields the longest increasing subsequence. This Java implementation is based entirely on this mathematical model http://www.ams.org/journals/bull/1999-36-04/S0273-0979-99-00796-X/S0273-0979-99-00796-X.pdf Patience sort is an O(n log n )algorithm