问：删除循环链表中重复元素的程序。

2025年1月8日 | 阅读 8 分钟

说明

在此程序中，我们将创建一个循环链表并删除列表中的重复节点。我们将一个节点与列表的其余部分进行比较，并检查重复项。如果找到重复项，则从列表中删除重复节点。

1->2->2->4->3

在上面的列表中，我们可以看到节点 2 在列表中出现了两次。因此，我们将有一个 current 节点遍历列表。index 指向 current 的下一个节点。Temp 指向 index 前面的节点。找到重复项时，通过将 temp.next 指向 index.next 来删除它。删除重复项后的列表

1->2->4->3

算法

定义一个 Node 类，它表示列表中的一个节点。它有两个属性 data 和 next，next 将指向下一个节点。
定义另一个类来创建循环链表，它有两个节点：head 和 tail。
removeDuplicate() 将删除列表中的重复节点
1. current 节点将指向 head，并用于遍历列表。
2. index 将指向 current 的下一个节点，temp 将指向 index 的前一个节点。
3. 我们将比较 current.data 和 index.data。如果找到匹配项，则通过将 temp 的 next 指向 index 的 next 来删除重复数据。
4. 将 index 递增到 index.next，将 current 递增到 current.next。
5. 重复步骤 c 到 d，直到所有重复项都被删除。

解决方案

Python

#Represents the node of list.
#Represents the node of list.
class Node:
  def __init__(self,data):
    self.data = data;
    self.next = None;

class CreateList:
  #Declaring head and tail pointer as null.
  def __init__(self):
    self.head = Node(None);
    self.tail = Node(None);
    self.head.next = self.tail;
    self.tail.next = self.head;
  
  #This function will add the new node at the end of the list.
  def add(self,data):
    newNode = Node(data);
    #Checks if the list is empty.
    if self.head.data is None:
      #If list is empty, both head and tail would point to new node.
      self.head = newNode;
      self.tail = newNode;
      newNode.next = self.head;
    else:
      #tail will point to new node.
      self.tail.next = newNode;
      #New node will become new tail.
      self.tail = newNode;
      #Since, it is circular linked list tail will point to head.
      self.tail.next = self.head;
  
  #Removes duplicate from the list
  def removeDuplicate(self):
    #Current will point to head
    current = self.head;
    if(self.head == None):
      print("List is empty");
    else:
      while(True):
        #Temp will point to previous node of index.
        temp = current;
        #Index will point to node next to current
        index = current.next;
        while(index != self.head):
          #If current node is equal to index data
          if(current.data == index.data):
            #Here, index node is pointing to the node which is duplicate of current node
            #Skips the duplicate node by pointing to next node
            temp.next = index.next;
          else:
            #Temp will point to previous node of index.
            temp = index;
          index= index.next;
        current =current.next;
        if(current.next == self.head):
          break;
          
  #Displays all the nodes in the list
  def display(self):
    current = self.head;
    if self.head is None:
      print("List is empty");
      return;
    else:
      #Prints each node by incrementing pointer.
      print(current.data);
      while(current.next != self.head):
        current = current.next;
        print(current.data);
    print("\n");
      
class CircularLinkedList:
  cl = CreateList();
  #Adds data to the list
  cl.add(1);
  cl.add(2);
  cl.add(3);
  cl.add(2);
  cl.add(2);
  cl.add(4);
  
  print("Originals list: ");
  cl.display();
  #Removes duplicate nodes
  cl.removeDuplicate();
  print("List after removing duplicates: ");
  cl.display();

输出

Originals list: 
 1 2 3 2 2 4
List after removing duplicates: 
 1 2 3 4

C

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//Represents the node of list.
struct node{
    int data;
    struct node *next;
};

//Declaring head and tail pointer as null.
struct node *head = NULL;
struct node *tail = NULL;

//This function will add the new node at the end of the list.
void add(int data){
    //Create new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    //Checks if the list is empty.
    if(head == NULL){
        //If list is empty, both head and tail would point to new node.
        head = newNode;
        tail = newNode;
        newNode->next = head;
    }else {
        //tail will point to new node.
tail->next = newNode;
//New node will become new tail.
tail = newNode;
//Since, it is circular linked list tail will point to head.
tail->next = head;
}
}

//Removes duplicate from the list
void removeDuplicate() {
//Current will point to head
struct node *current = head, *index = NULL, *temp = NULL;
if(head == NULL) {
printf("List is empty");
}
else {
do{
//Temp will point to previous node of index.
temp = current;
//Index will point to node next to current
index = current->next;
while(index != head) {
//If current node is equal to index data
if(current->data == index->data) {
//Here, index node is pointing to the node which is duplicate of current node
//Skips the duplicate node by pointing to next node
temp->next = index->next;
}
else{
     //Temp will point to previous node of index.
     temp = index;
}
index= index->next;
}
current =current->next;
}while(current->next != head); 
}
}
//This function will display the nodes of circular linked list
void display(){
    struct node *current = head;
    if(head == NULL){
        printf("List is empty");
    }
    else{
 do{
     //Prints each node by incrementing pointer.
printf("%d ", current->data);
current = current->next;
}while(current != head);
printf("\n");
    }
}
    
int main()
{
   //Adds data to the list
   add(1);
   add(2);
   add(3);
   add(2);
   add(2);
   add(4);
   printf("Originals list: \n");
   display();
   //Removes duplicate nodes
   removeDuplicate();
   printf("List after removing duplicates: \n");
   display();
   
   return 0;
}

输出

Originals list: 
 1 2 3 2 2 4
List after removing duplicates: 
 1 2 3 4

JAVA

public class RemoveDuplicate {
//Represents the node of list.
public class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
}
}
//Declaring head and tail pointer as null.
public Node head = null;
public Node tail = null;
//This function will add the new node at the end of the list.
public void add(int data){
//Create new node
Node newNode = new Node(data);
//Checks if the list is empty.
if(head == null) {
 //If list is empty, both head and tail would point to new node.
head = newNode;
tail = newNode;
newNode.next = head;
}
else {
//tail will point to new node.
tail.next = newNode;
//New node will become new tail.
tail = newNode;
//Since, it is circular linked list tail will points to head.
tail.next = head;
}
}
//Removes duplicate from the list
public void removeDuplicate() {
//Current will point to head
Node current = head, index = null, temp = null;
if(head == null) {
System.out.println("List is empty");
}
else {
do{
//Temp will point to previous node of index.
temp = current;
//Index will point to node next to current
index = current.next;
while(index != head) {
//If current node is equal to index data
if(current.data == index.data) {
//Here, index node is pointing to the node which is duplicate of current node
//Skips the duplicate node by pointing to next node
temp.next = index.next;
}
else {
//Temp will point to previous node of index.
temp = index;
}
index= index.next;
}
current =current.next;
}while(current.next != head); 
}
}
//Displays all the nodes in the list
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
}
else {
 do{
//Prints each node by incrementing pointer.
System.out.print(" "+ current.data);
current = current.next;
}while(current != head);
System.out.println();
}
}
public static void main(String[] args) {
RemoveDuplicate cl = new RemoveDuplicate();
//Adds data to the list
cl.add(1);
cl.add(2);
cl.add(3);
cl.add(2);
cl.add(2);
cl.add(4);
System.out.println("Originals list: ");
cl.display();
//Removes duplicate nodes
cl.removeDuplicate();
System.out.println("List after removing duplicates: ");
cl.display();
}
}

输出

Originals list: 
 1 2 3 2 2 4
List after removing duplicates: 
 1 2 3 4

C#

using System;
namespace CircularLinkedList
{
public class Program
{
//Represents the node of list.
public class Node<T>{
public T data;
public Node<T> next;
public Node(T value) {
data = value;
next = null;
}
}
public class CreateList<T>{
protected Node<T> head = null;
  protected Node<T> tail = null;
//This function will add the new node at the end of the list.
public void add(T data){
//Create new node
Node<T> newNode = new Node<T>(data);
//Checks if the list is empty.
if(head == null){
head = newNode;
tail = newNode;
newNode.next = head;
}else{
//tail will point to new node.
tail.next = newNode;
//New node will become new tail.
tail = newNode;
//Since, it is circular linked list tail will point to head.
tail.next = head;
}
}
//Removes duplicate from the list
public void removeDuplicate() {
//Current will point to head
Node<T> current = head, index = null, temp = null;
if(head == null) {
Console.WriteLine("List is empty");
}
else {
do{
//Temp will point to previous node of index.
temp = current;
//Index will point to node next to current
index = current.next;
while(index != head) {
//If current node is equal to index data
if(current.data.Equals(index.data)) {
//Here, index node is pointing to the node which is duplicate of current node
//Skips the duplicate node by pointing to next node
temp.next = index.next;
}
else{
//Temp will point to previous node of index.
temp = index;
}
index= index.next;
}
current =current.next;
}while(current.next != head); 
}
}
//Displays all the nodes in the list
public void display(){
Node<T> current = head;
if(head == null){
Console.WriteLine("List is empty");
}
else{
do{
//Prints each node by incrementing pointer.
Console.Write(" "+ current.data);
current = current.next;
}while(current != head);
Console.WriteLine();
}
} 
}
public static void Main()
{
CreateList<int> cl = new CreateList<int>();
//Adds data to the list
cl.add(1);
cl.add(2);
cl.add(3);
cl.add(2);
cl.add(2);
cl.add(4);
Console.WriteLine("Originals list: ");
cl.display();
//Removes duplicate nodes
cl.removeDuplicate();
Console.WriteLine("List after removing duplicates: ");
cl.display();
} 
}
}

输出

Originals list: 
 1 2 3 2 2 4
List after removing duplicates: 
 1 2 3 4

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represents the node of list.
class Node{
    public $data;
    public $next;
    function __construct($data){
        $this->data = $data;
        $this->next = NULL;
    }
}
class CreateList{
    //Declaring head and tail pointer as null.
    private $head;
    private $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    //This function will add the new node at the end of the list.
    function add($data){
        //Create new node
        $newNode = new Node($data);
        //Checks if the list is empty.
        if($this->head == NULL){
            //If list is empty, both head and tail would point to new node.
            $this->head = $newNode;
            $this->tail = $newNode;
            $newNode->next = $this->head;
        }
        else{
            //tail will point to new node.
            $this->tail->next = $newNode;
            //New node will become new tail.
            $this->tail = $newNode;
            //Since, it is circular linked list tail will point to head.
            $this->tail->next = $this->head;
        }
    }
    
    //Removes duplicate from the list
function removeDuplicate() {
//Current will point to head
$current = $this->head;
if($this->head == NULL) {
echo "List is empty";
}
else {
do{
//Temp will point to previous node of index.
$temp = $current;
//Index will point to node next to current
$index = $current->next;
while($index != $this->head) {
//If current node is equal to index data
if($current->data == $index->data) {
//Here, index node is pointing to the node which is duplicate of current node
//Skips the duplicate node by pointing to next node
$temp->next = $index->next;
}
else {
//Temp will point to previous node of index.
$temp = $index;
}
$index= $index->next;
}
$current = $current->next;
}while($current->next != $this->head); 
}
}
    
    //Displays all the nodes in the list
    function display() {
        $current = $this->head;
        if($this->head == NULL) {
            echo "List is empty";
        }
        else {
             do{
                //Prints each node by incrementing pointer.
                echo(" $current->data");
                $current = $current->next;
            }while($current != $this->head);
            echo "<br>";
        }
    }   
}
$cl = new CreateList();
//Adds data to the list
$cl->add(1);
$cl->add(2);
$cl->add(3);
$cl->add(2);
$cl->add(2);
$cl->add(4);

echo "Originals list:<br>";
$cl->display();
//Removes duplicate nodes
$cl->removeDuplicate();
echo "List after removing duplicates:<br>";
$cl->display();
?>
</body>
</html>

输出

Originals list: 
 1 2 3 2 2 4
List after removing duplicates: 
 1 2 3 4

下一主题#

问：删除循环链表中重复元素的程序。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

问：删除循环链表中重复元素的程序。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

编写查找长方体（Rectangular Prism）体积的程序

查找字符串的所有可能子集的程序

打印数字图案 6 的程序

将温度从摄氏度转换为开尔文的程序

编写计算半球表面积的程序

查找二叉树中最大元素的程序

将双向链表向右旋转 N 个节点的程序

打印 1 到 100 之间的所有快乐数的程序

在单向链表开头插入新节点的程序

显示数字三角形图案（19）的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器