摘要： typedef struct node {int data1;char data2[10];node *next;}*ptrN;ptrN accessNode(const ptrN head,int n){ptrN tmpNode;if (head == 0){return 0;}else{tmpNode = head;}for (int i = 0;i < n-1; i++){if (tmpNode->next == 0){return 0;}tmpNode = tmpNode->next;}return tmpNode;}ptrN accessTrail(const pt 阅读全文

摘要： #include <afx.h>#include <iostream>#include <string>#include <vector>#include <io.h>#include <stdio.h>#include <fcntl.h>#include <boost/filesystem.hpp>#include <iostream> #include <boost/thread/thread.hpp> #include <string> #include & 阅读全文

摘要： #include <afx.h>#include <iostream>#include <string>#include <vector>#include <io.h>#include <stdio.h>#include <fcntl.h>#include <boost/filesystem.hpp>#include <iostream> #include <boost/thread/thread.hpp> #include <string> #include & 阅读全文