不交换数据交换单链表中节点的程序

2025年3月17日 | 阅读 10 分钟

说明

在此程序中，我们需要在单链表中交换给定的两个节点，而不交换数据。

Program to swap nodes in a singly linked list without swapping data

完成此任务的方法之一是交换给定两个节点的父节点，然后交换两个节点的子节点。

算法

创建一个名为 Node 的类，它有两个属性：data 和 next。Next 是指向链表中下一个节点的指针。
创建另一个名为 SwapNodes 的类，它有两个属性：head 和 tail。
addNode() 将向列表添加一个新节点
1. 创建一个新节点。
2. 它首先检查 head 是否等于 null，这意味着列表为空。
3. 如果列表为空，则 head 和 tail 都将指向新添加的节点。
4. 如果列表不为空，新节点将添加到列表末尾，使得 tail 的 next 指向新添加的节点。此新节点将成为列表的新 tail。
swap() 将交换列表中存在的给定两个节点
1. 设 n1 和 n2 是需要交换的值。
2. 如果列表为空，则从函数返回。
3. 如果 n1 和 n2 相等，则列表不会有任何改变。
4. 如果列表不为空，则通过遍历列表来搜索 n1，使得 prevNode1 指向 node1 的前一个节点，node1 指向具有值 n1 的节点。
5. 类似地，通过遍历列表来搜索 n2，使得 prevNode2 指向 node2 的前一个节点，node2 指向具有值 n2 的节点。
6. 如果 prevNode1 指向 head，则 node2 将成为列表的 head。类似地，如果 prevNode2 指向 head，则 node1 将成为列表的 head。
7. 如果 prevNode1 或 prevNode2 未指向 head，则交换节点，使得 prevNode1 成为 node2 的前一个节点，prevNode2 成为 node1 的前一个节点。
8. 现在，交换 node1 和 node2 的下一个节点。
display() 将显示列表中存在的节点
1. 定义一个节点 current，它最初将指向列表的 head。
2. 遍历列表直到 current 指向 null。
3. 通过使 current 在每次迭代中指向它的下一个节点来显示每个节点。

解决方案

Python

#Represent a node of the singly linked list
class Node:
    def __init__(self,data):
        self.data = data;
        self.next = None;
        
class SwapNodes:
    #Represent the head and tail of the singly linked list
    def __init__(self):
        self.head = None;
        self.tail = None;
        
    #addNode() will add a new node to the list
    def addNode(self, data):
        #Create a new node
        newNode = Node(data);
        
        #Checks if the list is empty
        if(self.head == None):
            #If list is empty, both head and tail will point to new node
            self.head = newNode;
            self.tail = newNode;
        else:
            #newNode will be added after tail such that tail's next will point to newNode
            self.tail.next = newNode;
            #newNode will become new tail of the list
            self.tail = newNode;
            
    #swap() will swap the given two nodes
    def swap(self, n1, n2):
        prevNode1 = None;
        prevNode2 = None;
        node1 = self.head;
        node2 = self.head;
        
        #Checks if list is empty
        if(self.head == None):
            return;
            
        #If n1 and n2 are equal, then list will remain the same
        if(n1 == n2):
            return;
            
        #Search for node1
        while(node1 != None and node1.data != n1):
            prevNode1 = node1;
            node1 = node1.next;
            
        #Search for node2
        while(node2 != None and node2.data != n2):
            prevNode2 = node2;
            node2 = node2.next;
            
        if(node1 != None and node2 != None):
            
            #If previous node to node1 is not None then, it will point to node2
            if(prevNode1 != None):
                prevNode1.next = node2;
            else:
                self.head  = node2;
                
            #If previous node to node2 is not None then, it will point to node1
            if(prevNode2 != None):
                prevNode2.next = node1;
            else:
                self.head  = node1;
                
            #Swaps the next nodes of node1 and node2
            temp = node1.next; 
            node1.next = node2.next; 
            node2.next = temp;
        else:
            print("Swapping is not possible");
            
    #display() will display all the nodes present in the list
    def display(self):
        #Node current will point to head
        current = self.head;
        
        if(self.head == None):
            print("List is empty");
            return;
        while(current != None):
            #Prints each node by incrementing pointer
            print(current.data),
            current = current.next;
       
 
sList = SwapNodes();
 
#Add nodes to the list
sList.addNode(1);
sList.addNode(2);
sList.addNode(3);
sList.addNode(4);
sList.addNode(5);
 
print("Original list: ");
sList.display();
 
 
#Swaps the node 2 with node 5
sList.swap(2,5);
 
print("List after swapping nodes: ");
sList.display();

输出

Original list: 
1 2 3 4 5 
List after swapping nodes: 
1 5 3 4 2

C

#include <stdio.h>
 
//Represent a node of the singly linked list
struct node{
    int data;
    struct node *next;
};    
 
//Represent the head and tail of the singly linked list
struct node *head, *tail = NULL;
 
//addNode() will add a new node to the list
void addNode(int data) {
    //Create a new node
    struct node *newNode = (struct node*)malloc(sizeof(struct node));
    newNode->data = data;
    newNode->next = NULL;
    
    //Checks if the list is empty
    if(head == NULL) {
        //If list is empty, both head and tail will point to new node
        head = newNode;
        tail = newNode;
    }
    else {
        //newNode will be added after tail such that tail's next will point to newNode
        tail->next = newNode;
        //newNode will become new tail of the list
        tail = newNode;
    }
}
 
//swap() will swap the given two nodes
void swap(int n1, int n2){
    struct node *prevNode1 = NULL, *prevNode2 = NULL, *node1 = head, *node2 = head, *temp = NULL;
    
    //Checks if list is empty
    if(head == NULL) {
        return;
    }
        
    //If n1 and n2 are equal, then list will remain the same
    if(n1 == n2)
        return;
    
    //Search for node1
    while(node1 != NULL && node1->data != n1){
        prevNode1 = node1;
        node1 = node1->next;
    }
    
    //Search for node2
    while(node2 != NULL && node2->data != n2){
        prevNode2 = node2;
        node2 = node2->next;
    }
    
    if(node1 != NULL && node2 != NULL) {
        
        //If previous node to node1 is not null then, it will point to node2
        if(prevNode1 != NULL)
            prevNode1->next = node2;        
        else
            head  = node2;
        
        //If previous node to node2 is not null then, it will point to node1
        if(prevNode2 != NULL)
            prevNode2->next = node1;
        else
            head  = node1;
        
        //Swaps the next nodes of node1 and node2
        temp = node1->next; 
        node1->next = node2->next; 
        node2->next = temp;     
    }    
    else{
        printf("Swapping is not possible\n");
    }
}
    
//display() will display all the nodes present in the list
void display() {
    //Node current will point to head
    struct node *current = head;
    
    if(head == NULL) {
        printf("List is empty\n");
        return;
    }
    while(current != NULL) {
        //Prints each node by incrementing pointer
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}
    
int main()
{
    //Add nodes to the list
    addNode(1);
    addNode(2);
    addNode(3);
    addNode(4);
    addNode(5);
    
    printf("Original list: \n");
    display();
    
    //Swaps the node 2 with node 5
    swap(2,5);
    
    printf("List after swapping nodes: \n");
    display();
 
    return 0;
}

输出

Original list: 
1 2 3 4 5 
List after swapping nodes: 
1 5 3 4 2

JAVA

public class SwapNodes {
    
    //Represent a node of the singly linked list
    class Node{
        int data;
        Node next;
        
        public Node(int data) {
            this.data = data;
            this.next = null;
        }
    }
 
    //Represent the head and tail of the singly linked list
    public Node head = null;
    public Node tail = null;
    
    //addNode() will add a new node to the list
    public void addNode(int data) {
        //Create a new node
        Node newNode = new Node(data);
        
        //Checks if the list is empty
        if(head == null) {
            //If list is empty, both head and tail will point to new node
            head = newNode;
            tail = newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            tail.next = newNode;
            //newNode will become new tail of the list
            tail = newNode;
        }
    }
    
    //swap() will swap the given two nodes
    public void swap(int n1, int n2){
        Node prevNode1 = null, prevNode2 = null, node1 = head, node2 = head;
        
        //Checks if list is empty
        if(head == null) {
            return;
        }
        
        //If n1 and n2 are equal, then list will remain the same
        if(n1 == n2)
            return;
        
        //Search for node1
        while(node1 != null && node1.data != n1){
            prevNode1 = node1;
            node1 = node1.next;
        }
        
        //Search for node2
        while(node2 != null && node2.data != n2){
            prevNode2 = node2;
            node2 = node2.next;
        }
        
        if(node1 != null && node2 != null) {
            
            //If previous node to node1 is not null then, it will point to node2
            if(prevNode1 != null)
                prevNode1.next = node2;        
            else
                head  = node2;
            
            //If previous node to node2 is not null then, it will point to node1
            if(prevNode2 != null)
                prevNode2.next = node1;
            else
                head  = node1;
            
            //Swaps the next nodes of node1 and node2
            Node temp = node1.next; 
            node1.next = node2.next; 
            node2.next = temp;     
        }    
        else {
            System.out.println("Swapping is not possible");
        }
    }
    
    //display() will display all the nodes present in the list
    public void display() {
        //Node current will point to head
        Node current = head;
        
        if(head == null) {
            System.out.println("List is empty");
            return;
        }
        while(current != null) {
            //Prints each node by incrementing pointer
            System.out.print(current.data + " ");
            current = current.next;
        }
        System.out.println();
    }
    
    public static void main(String[] args) {
        
        SwapNodes sList = new SwapNodes();
        
        //Add nodes to the list
        sList.addNode(1);
        sList.addNode(2);
        sList.addNode(3);
        sList.addNode(4);
        sList.addNode(5);
        
        System.out.println("Original list: ");
        sList.display();
        
        //Swaps the node 2 with node 5
        sList.swap(2,5);
        
        System.out.println("List after swapping nodes: ");
        sList.display();
    }
}

输出

Original list: 
1 2 3 4 5 
List after swapping nodes: 
1 5 3 4 2

C#

using System;
                    
public class CreateList
{
    //Represent a node of the singly linked list
    public class Node<T>{
        public T data;
        public Node<T> next;
        
        public Node(T value) {
            data = value;
            next = null;
        }
    }
        
    public class SwapNodes<T>{
        //Represent the head and tail of the singly linked list
        public Node<T> head = null;             
         public Node<T> tail = null;
    
        //addNode() will add a new node to the list
        public void addNode(T data) {
            //Create a new node
            Node<T> newNode = new Node<T>(data);
 
            //Checks if the list is empty
            if(head == null) {
                //If list is empty, both head and tail will point to new node
                head = newNode;
                tail = newNode;
            }
            else {
                //newNode will be added after tail such that tail's next will point to newNode
                tail.next = newNode;
                //newNode will become new tail of the list
                tail = newNode;
            }
        }
        
        //swap() will swap the given two nodes
        public void swap(int n1, int n2){
            Node<T> prevNode1 = null, prevNode2 = null, node1 = head, node2 = head;
 
            //Checks if list is empty
            if(head == null) {
                return;
            }
 
            //If n1 and n2 are equal, then list will remain the same
            if(n1 == n2)
                return;
 
            //Search for node1
            while(node1 != null && !(node1.data.Equals(n1))){
                prevNode1 = node1;
                node1 = node1.next;
            }
 
            //Search for node2
            while(node2 != null && !(node2.data.Equals(n2))){
                prevNode2 = node2;
                node2 = node2.next;
            }
 
            if(node1 != null && node2 != null) {
 
                //If previous node to node1 is not null then, it will point to node2
                if(prevNode1 != null)
                    prevNode1.next = node2;        
                else
                    head  = node2;
 
                //If previous node to node2 is not null then, it will point to node1
                if(prevNode2 != null)
                    prevNode2.next = node1;
                else
                    head  = node1;
 
                //Swaps the next nodes of node1 and node2
                Node<T> temp = node1.next; 
                node1.next = node2.next; 
                node2.next = temp;     
            }    
            else {
                Console.WriteLine("Swapping is not possible");
            }
        }
        
        //display() will display all the nodes present in the list
        public void display() {
            //Node current will point to head
            Node<T> current = head;
            
            if(head == null) {
                Console.WriteLine("List is empty");
                return;
            }
            while(current != null) {
                //Prints each node by incrementing pointer
                Console.Write(current.data + " ");
                current = current.next;
            }
            Console.WriteLine();
        }
    }
    
    public static void Main()
    {
        SwapNodes<int> sList = new SwapNodes<int>();
        
        //Add nodes to the list
        sList.addNode(1);
        sList.addNode(2);
        sList.addNode(3);
        sList.addNode(4);
        sList.addNode(5);
        
        Console.WriteLine("Original list: ");
        sList.display();
        
        //Swaps the node 2 with node 5
        sList.swap(2,5);
        
        Console.WriteLine("List after swapping nodes: ");
        sList.display();    
    }
}

输出

Original list: 
1 2 3 4 5 
List after swapping nodes: 
1 5 3 4 2

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Represent a node of singly linked list
class Node{
    public $data;
    public $next;
    
    function __construct($data){
        $this->data = $data;
        $this->next = NULL;
    }
}
class SwapNodes{
    //Represent the head and tail of the singly linked list
    public $head;
    public $tail;
    function __construct(){
        $this->head = NULL;
        $this->tail = NULL;
    }
    
    //addNode() will add a new node to the list
    function addNode($data) {
        //Create a new node
        $newNode = new Node($data);
        
        //Checks if the list is empty
        if($this->head == NULL) {
            //If list is empty, both head and tail will point to new node
            $this->head = $newNode;
            $this->tail = $newNode;
        }
        else {
            //newNode will be added after tail such that tail's next will point to newNode
            $this->tail->next = $newNode;
            //newNode will become new tail of the list
            $this->tail = $newNode;
        }
    }
    
    //swap() will swap the given two nodes
    function swap($n1, $n2){
        $prevNode1 = null;
        $prevNode2 = null;
        $node1 = $this->head;
        $node2 = $this->head;
        
        //Checks if list is empty
        if($this->head == null) {
            return;
        }
        
        //If n1 and n2 are equal, then list will remain the same
        if($n1 == $n2)
            return;
        
        //Search for node1
        while($node1 != null && $node1->data != $n1){
            $prevNode1 = $node1;
            $node1 = $node1->next;
        }
        
        //Search for node2
        while($node2 != null && $node2->data != $n2){
            $prevNode2 = $node2;
            $node2 = $node2->next;
        }
        
        if($node1 != null && $node2 != null) {
            
            //If previous node to node1 is not null then, it will point to node2
            if($prevNode1 != null)
                $prevNode1->next = $node2;        
            else
                $this->head  = $node2;
            
            //If previous node to node2 is not null then, it will point to node1
            if($prevNode2 != null)
                $prevNode2->next = $node1;
            else
                $this->head  = $node1;
            
            //Swaps the next nodes of node1 and node2
            $temp = $node1->next; 
            $node1->next = $node2->next; 
            $node2->next = $temp;     
        }    
        else {
            print("Swapping is not possible <br>");
        }
    }
    
    //display() will display all the nodes present in the list
    function display() {
        //Node current will point to head
        $current = $this->head;
        
        if($this->head == NULL) {
            print("List is empty <br>");
            return;
        }
        while($current != NULL) {
            //Prints each node by incrementing pointer
            print($current->data . " ");
            $current = $current->next;
        }
        print("<br>");
    }
}
    
$sList = new SwapNodes();
        
//Add nodes to the list
$sList->addNode(1);
$sList->addNode(2);
$sList->addNode(3);
$sList->addNode(4);
$sList->addNode(5);
 
print("Original list: <br>");
$sList->display();
 
//Swaps the node 2 with node 5
$sList->swap(2,5);
 
print("List after swapping nodes: <br>");
$sList->display();
?>
</body>
</html>

输出

Original list: 
1 2 3 4 5 
List after swapping nodes: 
1 5 3 4 2

下一主题#

不交换数据交换单链表中节点的程序

说明

算法

解决方案

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

相关帖子

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

创建和显示双向链表的程序

从循环链表中删除中间新节点的程序

编写计算六边形周长的程序

从单链表中查找最大值和最小值节点的程序

检查迪沙里数（Disarium number）的程序

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

计算立方体表面积的程序

打印前 10 个素数的程序

在单链表中搜索元素的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器