leet83vs运行版
2016-12-18 20:59
260 查看
#include<iostream>
using namespace std;
struct Node
{
int data;
Node* next;
};
class LinkList
{
public:
LinkList(int a[], int n);
Node* LinkList::deleteDuplicates(Node* head);
void coutlinklist(Node*head);
Node * getHead();
private:
Node* head;
};
Node* LinkList::getHead()
{
return head;
}
LinkList::LinkList(int a[], int n)
{
head = new Node;
Node* front = head;
front->next = NULL;
for (int i = n - 1; i >= 0; i--)
{
Node* s = new Node;
s->data = a[i];
s->next = front->next;
front->next = s;
}
}
Node* LinkList::deleteDuplicates(Node* head)
{
if (head != NULL)
{
Node* p = head;
while (p->next != NULL)
{
if (p->data == p->next->data)
{
p->next = p->next->next;
}
else
{
p = p->next;
}
}
}
return head;
}
void LinkList::coutlinklist(Node* head)
{
Node *p = head;
while (p->next != NULL)
{
p = p->next;
cout << p->data << ' ';
}
}
int main()
{
int a[5] = { 1, 1, 2, 3, 3 };
LinkList L(a, 5);
L.coutlinklist(L.getHead());
cout << endl;
L.deleteDuplicates(L.getHead());
L.coutlinklist(L.getHead());
return 0;
}
using namespace std;
struct Node
{
int data;
Node* next;
};
class LinkList
{
public:
LinkList(int a[], int n);
Node* LinkList::deleteDuplicates(Node* head);
void coutlinklist(Node*head);
Node * getHead();
private:
Node* head;
};
Node* LinkList::getHead()
{
return head;
}
LinkList::LinkList(int a[], int n)
{
head = new Node;
Node* front = head;
front->next = NULL;
for (int i = n - 1; i >= 0; i--)
{
Node* s = new Node;
s->data = a[i];
s->next = front->next;
front->next = s;
}
}
Node* LinkList::deleteDuplicates(Node* head)
{
if (head != NULL)
{
Node* p = head;
while (p->next != NULL)
{
if (p->data == p->next->data)
{
p->next = p->next->next;
}
else
{
p = p->next;
}
}
}
return head;
}
void LinkList::coutlinklist(Node* head)
{
Node *p = head;
while (p->next != NULL)
{
p = p->next;
cout << p->data << ' ';
}
}
int main()
{
int a[5] = { 1, 1, 2, 3, 3 };
LinkList L(a, 5);
L.coutlinklist(L.getHead());
cout << endl;
L.deleteDuplicates(L.getHead());
L.coutlinklist(L.getHead());
return 0;
}
相关文章推荐
- 2016.12.8 Using Python to Access Web Data
- apache功能简单了解
- Android Studio 工具栏添加图标
- LeetCode105: Construct Binary Tree from Preorder and Inorder Traversal
- 230. Kth Smallest Element in a BST ——迭代本质:a=xx1 while some_condition: a=xx2
- Java通过SMS短信平台实现发短信功能
- 子网掩码
- 其他
- [003-Makefile-笔记] Makefile的规则
- Reflux.connect mixin 学习
- Android新浪微博分享实现
- 鸟人的Android揭秘(5)——搭建Android SDK开发环境(一)
- 字符串哈希(自然溢出模板)
- TileJSON
- 预备作业2:阅读心得(20155231邵煜楠)
- 树梅派应用12:使用 RPi.GPIO 模块的输出(Output)功能
- 最优化复习要点
- 【机器学习实验】scikit-learn的主要模块和基本使用
- leet24
- 小白学《神经网络与深度学习》笔记之二-利用稀疏编码器找图像的基本单位(1)MatLab实现SparseAutoEncoder