C說話完成輸入鏈表中倒數第k個節點

C說話完成輸入鏈表中倒數第k個節點。本站提示廣大學習愛好者：（C說話完成輸入鏈表中倒數第k個節點）文章只能為提供參考，不一定能成為您想要的結果。以下是C說話完成輸入鏈表中倒數第k個節點正文

本文實例展現了C++完成輸入鏈表中倒數第k個節點的辦法，分享給年夜家供年夜家參考之用。

運轉本文所述實例可完成輸出一個單向鏈表，輸入該鏈表中倒數第k個節點。

詳細完成辦法以下：

/* 
* Copyright (c) 2011 alexingcool. All Rights Reserved. 
*/ 
#include <iostream>

using namespace std;

int array[] = {5, 7, 6, 9, 11, 10, 8};
const int size = sizeof array / sizeof *array;

struct Node
{
 Node(int i = 0, Node *n = NULL) : item(i), next(n) {}

 int item;
 Node *next;
};

Node* construct(int (&array)[size])
{
 Node dummy;
 Node *head = &dummy;

 for(int i = 0; i < size; i++) {
 Node *temp = new Node(array[i]);
 head->next = temp;
 head = temp;
 }

 return dummy.next;
}

void print(Node *head)
{
 while(head) {
 cout << head->item << " ";
 head = head->next;
 }
}

Node* findKnode(Node *head, int k)
{
 Node *pKnode = head;

 if(head == NULL) {
 cout << "link is null" << endl;
 return NULL;
 }

 while(k--) {
 if(head == NULL) {
  cout << "k is bigger than the length of the link" << endl;
  return NULL;
 }

 head = head->next;
 }

 while(head) {
 head = head->next;
 pKnode = pKnode->next;
 }

 return pKnode;
}

void main()
{
 Node *head = construct(array);
 cout << "source link: ";
 print(head);
 cout << endl;
 Node *kNode = findKnode(head, 5);
 if(kNode != NULL)
 cout << "the knode is: " << kNode->item << endl;
}

測試用例以下：

1. NULL Link
    head = NULL;
2. normal Link, with normal k
    k <= len(head);
3. normal Link, with invalid k
    k > len(head)

願望本文所述對年夜家C法式算法設計的進修有所贊助。