题解 | #反转链表#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
 */
struct ListNode* ReverseList(struct ListNode* head ) {

        struct ListNode* N = NULL;
        struct ListNode* next = NULL;
        while (head) {
            next = head ->next;
            head ->next = N;
            N = head;
            head = next;        
        }
        return N;
    // write code here
}

对链表做一次遍历，依次将头结点接到输出结点尾部即可