查找倒数第K个结点，要求之便利一遍

思路：快慢指针

//查找倒数第K个结点，要求之便利一遍
#include<iostream>
using namespace std;

typedef int DataType;
typedef struct SListNode
{
           DataType data;            //数据
           struct SListNode * next;   //指向下一个结点的指针
}SListNode;

SListNode* CreateNode(DataType x)  //创造结点
{
           //1.先开辟空间 2.数据赋给data 3.指针置空
           SListNode* NewNode = (SListNode *)malloc(sizeof (SListNode));
          NewNode->data = x;
          NewNode->next = NULL;

           return NewNode;
}

void PushBack(SListNode * &ppHead, DataType Data )
{
           //1.none 2.one and more
           if (ppHead == NULL)
          {
                    ppHead = CreateNode(Data );
          }
           else
          {
                    //1.先找到尾结点 2.把新节点链起来
                    SListNode* cur = ppHead ;
                    while (cur->next)
                   {
                             cur = cur->next;
                   }
                   cur->next = CreateNode( Data);

          }
}

//查找倒数第K个结点
SListNode* FindLastKNode(SListNode * pHead, int k )
{
           SListNode* fast = pHead ;
           SListNode* slow = pHead ;
           while (fast&&k --)
          {
                   fast = fast->next;
                   
          }
           while (fast)
          {
                   fast = fast->next;
                   slow = slow->next;
          }
           return slow;

}

void Test()
{
           SListNode* pHead = NULL ;
          PushBack(pHead, 1);
          PushBack(pHead, 2);
          PushBack(pHead, 3);
          PushBack(pHead, 4);
          PushBack(pHead, 5);
          PushBack(pHead, 6);
          PushBack(pHead, 7);
          cout << FindLastKNode(pHead, 4)->data << endl;
}

int main()
{
          Test();
          system( "pause");
           return  0;
}