摘要: ListNode* ReverseList(ListNode* head, ListNode* tail) { ListNode* pre = NULL; ListNode* next = NULL; while (head != tail) { next = head->next; head->n 阅读全文
posted @ 2021-03-10 19:06 唯一诺 阅读(62) 评论(0) 推荐(0)