今日开始写数据结构预算法题目集: 函数题1: List Reverse( List L ) { List prev = NULL; List curr = L; while (curr != NULL) { List nextTemp = curr->Next; curr->Next = prev; prev = curr; curr = nextTemp; } return prev; }