408数据结构算法-2009

#include <iostream>
#include <vector>

using namespace std;
struct LinkNode {
    int data;
    LinkNode *next;
};

void createLinkNode(LinkNode *link, vector<int> v) {
    LinkNode *head = link;

    for (int i: v) {
        LinkNode *temp = new LinkNode();
        temp->next = nullptr;
        temp->data = i;
        head->next = temp;
        head = head->next;
    }
}

void showLinkNode(LinkNode *link) {
    link = link->next;
    while (link != nullptr) {
        cout << link->data << " ";
        link = link->next;
    }
    cout << endl;
}

int searchReversedK(LinkNode *link, int k) {
    LinkNode *l1, *l2;
    int count = 0;
    l1 = link;
    l2 = link;
    for (int i = 0; i < k; i++) {
        l1 = l1->next;
        count++;
    }
    while (l1 != nullptr) {
        l1 = l1->next;
        l2 = l2->next;
        count++;
    }
    if (count < k)return 0;
    return l2->data;
}

int main() {
    vector<int> v = {1, 3, 4, 2, 5};
    LinkNode *link = new LinkNode();
    createLinkNode(link, v);
    showLinkNode(link);
    cout << searchReversedK(link, 6);
}