2020.3.16
1.跳出循环可以不用break而是直接令 i/j = n;
2.struct ListNode reverseList(struct ListNode head) {
struct ListNode *newHead = NULL;
struct ListNode *node;
while (head != NULL) {
//1. 对之前的链表做头删
node = head;
head = head->next;
//2. 对新链表做头插
node->next = newHead;
newHead = node;
}
return newHead;
}