版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/pengshengli/article/details/84654685
结构体模板与类模板一样,使用的时候注意细节:
#include "stdafx.h"
#include<iostream>
#include<vector>
using namespace std;
template <typename T>
struct Node {
T data;
Node<T> *next;
};
template <typename T>
Node<T> *CreatList(vector<T> &arr)
{
//Node<T> *head = (Node<T>*)malloc(sizeof(Node<T>));
Node<T> *head = new Node<T>;
Node<T> *pre = head;
Node<T> *p = NULL;
for (unsigned int i = 0; i < arr.size(); i++)
{
//p= (Node<T>*)malloc(sizeof(Node<T>));
p = new Node<T>;
pre->next = p;
p->data = arr[i];
pre = p;
}
p->next = NULL;
return head;
}
template <typename T>
void PrintList(Node<T> *head)
{
Node<T> *p = head;
while (p->next != NULL)
{
p = p->next;
cout << p->data << "->";
}
cout<<"NULL"<< endl;
}
int main()
{
vector<int> arr(5);
arr = {1,2,3,4,5};
Node<int> *head = CreatList(arr);
PrintList(head);
getchar();
return 0;
}
也就是说,一旦Node里面使用的模板T,只要使用Node就得在哪都要带上<T>
结果:
链表的节点增删,翻转:
#include "stdafx.h"
#include<iostream>
#include<vector>
using namespace std;
template <typename T>
struct Node {
T data;
Node<T> *next;
};
template <typename T>
Node<T> *CreatList(vector<T> &arr)
{
//Node<T> *head = (Node<T>*)malloc(sizeof(Node<T>));
Node<T> *head = new Node<T>;
Node<T> *pre = head;
Node<T> *p = NULL;
for (unsigned int i = 0; i < arr.size(); i++)
{
//p= (Node<T>*)malloc(sizeof(Node<T>));
p = new Node<T>;
pre->next = p;
p->data = arr[i];
pre = p;
}
p->next = NULL;
return head->next;
}
template <typename T>
void PrintList(Node<T> *head)
{
Node<T> *p = new Node<T>;
p->next = head; //为了方便遍历
while (p->next != NULL)
{
p = p->next;
cout << p->data << "->";
}
cout<<"NULL"<< endl;
}
template <typename T>
Node<T>* reverseList(Node<T> *head)
{
Node<T> *pre = NULL, *cur = head, *temp;
while (cur != NULL)
{
temp = cur->next;
cur->next = pre;//翻转
pre = cur;
cur = temp;
}
return pre;
}
//插入第n个元素后面
template <typename T>
Node<T> * addNode(Node<T> *head, T val, int n)
{
Node<T> *p = head;
int i = n - 1;
while (i > 0)
{
p = p->next;
i--;
}
Node<T> *q = new Node<T>;//要插入的元素
q->data = val;
q->next = p->next;
p->next = q;
return head;
}
//删除第n个元素后面
template <typename T>
Node<T> * delNode(Node<T> *head, int n)
{
Node<T> *p = head;
int i = n - 1;
while (i > 0)
{
p = p->next;
if (p->next == NULL)//最后一个元素,不作删除
return head;
i--;
}
if (p->next->next == NULL)//倒数第二个(删除最后一个)
p->next = NULL;
else
p->next = p->next->next;
return head;
}
int main()
{
vector<int> arr(5);
arr = {1,2,3,4,5};
Node<int> *head = CreatList(arr);
PrintList(head);
/*Node<int> *rhead = reverseList(head);
PrintList(rhead);*/
Node<int> *addhead = addNode(head, 8, 3);
PrintList(addhead);
delNode(addhead,5);
PrintList(addhead);
getchar();
return 0;
}