题解 | #链表中倒数最后k个结点#
链表中倒数最后k个结点
http://www.nowcoder.com/practice/886370fe658f41b498d40fb34ae76ff9
using System;
using System.Collections.Generic;
/*
public class ListNode
{
public int val;
public ListNode next;
public ListNode (int x)
{
val = x;
}
}
*/
class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param pHead ListNode类
* @param k int整型
* @return ListNode类
*/
public ListNode FindKthToTail (ListNode pHead, int k) {
// write code here
Stack<ListNode> stack = new Stack<ListNode>();
ListNode iter = pHead;
int count = 0;
while(iter!=null){
stack.Push(iter);
iter = iter.next;
count ++;
}
if (count < k){
return null;
}else{
for(int i=0;i<k;i++){
iter = stack.Pop();
}
return iter;
}
}
}
using System.Collections.Generic;
/*
public class ListNode
{
public int val;
public ListNode next;
public ListNode (int x)
{
val = x;
}
}
*/
class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param pHead ListNode类
* @param k int整型
* @return ListNode类
*/
public ListNode FindKthToTail (ListNode pHead, int k) {
// write code here
Stack<ListNode> stack = new Stack<ListNode>();
ListNode iter = pHead;
int count = 0;
while(iter!=null){
stack.Push(iter);
iter = iter.next;
count ++;
}
if (count < k){
return null;
}else{
for(int i=0;i<k;i++){
iter = stack.Pop();
}
return iter;
}
}
}