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
| #include<iostream> using namespace std; struct Node { int data; Node* next; }; Node* head = NULL; void Insert() { int data, n; cout << "插入的位置为:"; cin >> n; cout << "插入的数据为:"; cin >> data; Node* temp1 = new Node(); temp1->data = data; temp1->next = NULL; if (n == 1) { temp1->next = head; head = temp1; return; } Node* temp2 = head; for (int i = 0; i < n - 2; i++) { temp2 = temp2->next; } temp1->next = temp2->next; temp2->next = temp1; } void Print() { Node*temp=head; cout << "List is "; while (temp != NULL) { cout << temp->data; temp = temp->next; } cout << endl; } int main() { Node*head = NULL; Insert(); Print(); Insert(); Print(); Insert(); Print(); Insert(); Print(); return 0; }
|