题目描述:输入一个链表,反转链表后,输出新链表的表头。
思路:定义两个指针,反向输出
package Function;
//迭代:两个指针,反向输出,时间复杂度:O(n),空间复杂度:O(1)
import Test.ListNode;
public class reverseList24 {
public ListNode reverseList(ListNode head) {
ListNode pre = null;
ListNode curr = head;
while (curr != null) {
ListNode tmp = curr.next;
curr.next = pre;
pre = curr;
curr = tmp;
} return pre;
}
}