数据挖掘Aprior的简易c++实现，通过string来表示数据集，没有采用STL set集合操作，因此实现起来简单一些，判断是否包含用到了动态规划算法中的最长公共子序列，思想是暴力求解，没有用到很高端的思想和算法。(Simple c++ data mining Aprior, said data set by the string, without the use of STL set collection operation, thus the realization is simple, determine whether to include use of the longest common subsequence dynamic programming algorithm, thought is a brute force solution, no thought and algorithm used in high-end.)