-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
78 lines (66 loc) · 1.27 KB
/
main.cpp
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <algorithm>
#include <iomanip>
struct ListNode
{
int val;
ListNode* next;
ListNode(int x):val(x), next(NULL) {}
};
int main()
{
ListNode* node, *p, *lis1, *lis2, *lis3;
for(int i = 0; i != 5; ++ i)
{
node = (ListNode*)malloc(sizeof(ListNode));
node->val = i;
node->next = NULL;
if(i == 0)
{
lis1 = node;
p = node;
}
else
{
p->next = node;
p = node;
}
}
for(int i = 0; i != 5; ++ i)
{
node = (ListNode*)malloc(sizeof(ListNode));
node->val = i+5;
node->next = NULL;
if(i == 0)
{
lis2 = node;
p = node;
}
else
{
p->next = node;
p = node;
}
}
for(int i = 0; i != 5; ++ i)
{
node = (ListNode*)malloc(sizeof(ListNode));
node->val = i;
node->next = NULL;
if(i == 0)
{
lis3 = node;
p = node;
}
else
{
p->next = node;
p = node;
}
}
system("pause");
return 0;
}