链接:https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&&tqId=11167&rp=2&ru=/activity/oj&qru=/ta/coding-interviews/question-ranking
//1.恒距丈量法
struct ListNode* FindKthToTail(struct ListNode* pListHead, int k )
{
struct ListNode* front,*back;
front=pListHead;
back =front;
while(k)
{
if(back==NULL)
{
return NULL;
}
back=back->next;
k--;
}
while(back)
{
front=front->next;
back=back->next;
}
return front;
// write code here
}
1617

被折叠的 条评论
为什么被折叠?



