题目:
输入一个链表,输出该链表中倒数第k个节点。为了符合大多数人的习惯,本题从1开始计数,即链表的尾节点是倒数第1个节点。例如,一个链表有6个节点,从头节点开始,它们的值依次是1、2、3、4、5、6。这个链表的倒数第3个节点是值为4的节点。
例1:
给定一个链表: 1->2->3->4->5, 和 k = 2.
返回链表 4->5.
Code(JAVA):
//方法1
public static ListNode getKthFromEnd01(ListNode head, int k) {
int count = 0;
ListNode newHead = head;
while (head != null) {
count = count + 1;
head = head.next;
}
int theKth = count + 1 - k;
if (theKth < 1) {
return null;
}
int index = 0;
while (newHead != null) {
index = index + 1;
if (index == theKth) {
return newHead;
} else {
newHead = newHead.next;
}
}
return null;
}
//方法2
public static ListNode getKthFromEnd02(ListNode head, int k) {
ListNode former = head;
ListNode latter = head;
for (int i = 0; i < k; i++) {
former = former.next;
}
while (former != null) {
former = former.next;
latter = latter.next;
}
return latter;
}
如果对您有所帮助,请关注公众号: