本文共 1135 字，大约阅读时间需要 3 分钟。

#include 
   
    #include 
    
     #include 
     
      using namespace std;struct ListNode{    int       m_nKey;    ListNode* m_pNext;};void createLinkList(ListNode* &pListHead, vector
      
        data){    int length = data.size();    int i = 0;    ListNode *p = pListHead;    while (i
       
        m_nKey = data[i];        q->m_pNext = NULL;        if (i==0)        {            pListHead = q;        }        else{            p->m_pNext = q;        }        p = q;          i++;    }}ListNode* FindKthToTail(ListNode* pListHead, unsigned int k){    int length;     int num;    cin >> length;    vector
        
          data; for (int i = 0; i < length; i++) { cin >> num; data.push_back(num); } cin >> k; createLinkList(pListHead, data); if (k>length) { return NULL; } int index = 0; ListNode *p = pListHead; ListNode *q= pListHead; while (p) { if (index>k) { q = q->m_pNext; } p = p->m_pNext; index ++ ; } return q;}int main(){ ListNode* pListHead = NULL; ListNode* result; int k = 0; result = FindKthToTail(pListHead,k); cout << result->m_nKey << endl; return 0;}
        
       
      
     
    
   

输入：

转载地址：http://tinws.baihongyu.com/