本算法为求解素数的较好代码，目前，较通用的算法时间复杂度通常为O（n*n），本文利用双向链表实现了时间复杂度为O（n）的算法-The algorithm for solving prime number the better the code, at present, a more generic algorithm time complexity is usually O (n* n), using two-way linked list realize the time complexity