1.解题思路
双指针迭代
2.java代码:
class Solution {
public ListNode reverseList(ListNode head) {
ListNode pre = null;
ListNode cur = head;
while(cur!=null)
{
ListNode temp = cur.next;
cur.next = pre;
pre = cur;
cur = temp;
}
return pre;
}
}
leetcode刷题206:反转链表
最新推荐文章于 2024-09-14 18:52:56 发布