algorithm/Kth_element.cpp at master · leobuzhi/algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<iostream>
#include<assert.h>
using namespace std;
typedef struct node{
    int data;
    struct node* next;
    node() :data(0), next(nullptr){}
}node;
typedef node* List;

void initList(List l)
{
    int data;
    List p,q;
    p = l;
    while (cin >> data)
    {
        q = new node;
        q->data = data;
        p->next = q;
        p = q;
    }
}
int kth_element(List l,int k)
{
    assert(l!=nullptr&&k>=1);
    List p, q;
    p = q = l;
    while (k - 1)
    {
        q = q->next;
        k--;
    }
    while (q->next)
    {
        p = p->next;
        q = q->next;
    }
    return p->data;

}
int main()
{
    node l;
    initList(&l);
    node* p = l.next;
    while (p)
    {
        cout << p->data << " ";
        p = p->next;
    }
    cout << endl;

    node* t = nullptr;
    cout << kth_element(&l, 4) << endl;
    cout << kth_element(&l, 0) << endl;
    cout << kth_element(t, 4) << endl;
    return 0;
}