毛佳茗de代码

1、反转一个链表。循环算法。 List reverse(List l) { if(!l) return l; list cur = l.next; list pre = l; list tmp; pre.next = null; while ( cur ) { tmp = cur; cur = cur.next; tmp.next = pre pre = tmp; } return tmp; }

MotivationA singly linked list is a common data structure familiar to all computer scientists. A singly linked list is made of nodes where each node has a pointer to the next node (or null to end th