19. Remove Nth Node From End of List
问题描述:
Given a linked list, remove the nth node from the end of list and return its head.
For example,
Given linked list: 1->2->3->4->5, and n = 2.
After removing the second node from the end, the linked list becomes 1->2->3->5.
Note:
Given n will always be valid.
Try to do this in one pass.
解析:
删除倒数第n个元素,有两种解题思路:
(1)遍历链表,得到链表长度为len,遍历链表到目标元素的前一个节点,即:
TreeNode temp=head;
for(int i=0;i<len-n;i++){
temp=temp.next;
}
temp.next=temp.next.next;
(2)定义两个指针,位置相差(n+1),当快指针移动到链表之外时,记作位置为len+1(下标从1开始),那么慢指针在(len+1)-(n+1)=len-n的位置,那么就是目标元素的前一个位置,所以,核心代码如下:
ListNode start=new ListNode(0);
ListNode fast=start;
ListNode slow=start;
slow.next=head;
for(int i=1;i<=n+1;i++)
fast=fast.next;
while(fast!=null){
fast=fast.next;
slow=slow.next;
}
slow.next=slow.next.next;
return start.next;//返回头指针
141. Linked List Cycle
问题描述:
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
解析:
给定一个链表,判断链表中是否存在环:
是否存在环的判定条件:定义两个指针(fast/slow):fast=fast.next.next; slow=slow.next;
如果在条件下有fast==slow,那么就存在环。注意循环条件。核心代码如下:
ListNode fast=head;
ListNode slow=head;
if(fast==null)
return false;
while(fast!=null && fast.next!=null){
fast=fast.next.next;
slow=slow.next;
if(fast==slow)
return true;
}
return !(fast==null || fast.next==null);