【leetcode】【单链表】【83】Remove Duplicates from Sorted List

ruan875417

于 2015-05-12 15:45:17 发布

阅读量375

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/ruan875417/article/details/45670471

leetcode 专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一个C++程序，该程序定义了一个链表结构并实现了一个解决方案，用于删除链表中所有值重复的节点。首先创建一个链表，然后通过遍历检查相邻节点是否具有相同的值，如果相同则删除重复节点。提供了创建链表、打印链表和删除重复项的功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<stack>
using namespace std;

struct ListNode {
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
	ListNode* deleteDuplicates(ListNode* head) {
		if (head == NULL || head->next == NULL)
			return head;
		ListNode* temp = NULL;
		ListNode* cur = head;
		while (cur->next){
			if (cur->val == cur->next->val){
				temp = cur->next;
				cur->next = temp->next;
				delete temp;
			}else
				cur = cur->next;
		}
		return head;
	}
	ListNode* createList(ListNode* head){
		int numOfNode;
		int value;
		cout << "please input number of listNode:";
		cin >> numOfNode;
		cin >> value;
		head = new ListNode(value);
		ListNode* cur = head;
		for (int i = 1; i < numOfNode; ++i){
			cin >> value;
			ListNode* temp = new ListNode(value);
			cur->next = temp;
			cur = temp;
		}
		return head;
	}
	void printNode(ListNode* head){
		ListNode* cur = head;
		while (cur){
			cout << cur->val << " ";
			cur = cur->next;
		}
		cout << endl;
	}
};

int main(){
	ListNode* head = NULL;
	Solution solution;
	head = solution.createList(head);
	solution.printNode(head);

	head = solution.deleteDuplicates(head);
	solution.printNode(head);

	system("pause");
	return 0;
}