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

→下一 ←上一页

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

解释

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

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

算法

创建一个类Node，它有两个属性:data和next。Next是指向列表中下一个节点的指针。
创建另一个类SwapNodes，它有两个属性:head和tail。
addNode()将向列表中添加一个新节点:
1. 创建一个新节点。
2. 它首先检查，头是否等于空，这意味着列表是空的。
3. 如果列表为空，则头和尾都指向新添加的节点。
4. 如果列表不为空，则新节点将被添加到列表的末尾，这样tail的next将指向新添加的节点。这个新节点将成为列表的新尾部。
Swap()将交换列表中给定的两个节点:
1. 设n1和n2是需要交换的值。
2. 如果列表为空，则从函数返回。
3. 如果n1和n2相等，那么列表中就不会有变化。
4. 如果列表不是空的，那么通过遍历列表来搜索n1，使得prevNode1指向node1之前的节点，节点1指向值为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. 定义一个节点电流，它将最初指向列表的头部。
2. 遍历列表，直到当前指向null。
3. 在每次迭代中，通过使current指向它旁边的节点来显示每个节点。

解决方案

Python

            表示单链表类node: def __init__(self,data): self的一个节点。Data =数据;自我。next =无;类SwapNodes: #表示单链表的头和尾def __init__(self): selfhead =无;自我。tail =无;#addNode()将添加一个新节点到列表def addNode(self, data): #创建一个新节点newNode = node (data);#检查列表是否为空。head == None): #如果list为空，则头和尾都指向新的节点self。head = newNode;自我。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();
           

输出:

原列表:1 2 3 4 5交换节点后列表:1 5 3 4 2

C

            #include <stdio.h> //表示单链表结构的节点node{int data;Struct node *next;};//表示单链表结构的头和尾节点*head， *tail = NULL;//addNode()将添加一个新的节点到列表void addNode(int data){//创建一个新的节点struct节点*newNode = (struct节点*)malloc(sizeof(struct节点));newNode->data = data;newNode->next = NULL;//检查列表是否为空if(head == NULL){//如果列表为空，头和尾都指向新节点head = newNode;tail = newNode;} else{//将在tail之后添加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; }
           

输出:

原列表:1 2 3 4 5交换节点后列表:1 5 3 4 2

JAVA

            公共类SwapNodes{//表示单链表类node的节点{int data;节点下;公共节点(int data){这个。Data =数据;这一点。Next = null;}} //表示单链表的头和尾public节点头= null;public Node tail = null;//addNode()将添加一个新节点到列表public void addNode(int data){//创建一个新节点newNode =新节点(数据);//检查列表是否为空if(head == null){//如果列表为空，头和尾都指向新节点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(); } }
           

输出:

原列表:1 2 3 4 5交换节点后列表:1 5 3 4 2

c#

            使用系统;公共类CreateList{//表示一个节点的单链表公共类node <T>{公共T数据;public Node<T> next;public Node(T value) {data = value;Next = null;}} public class SwapNodes<T>{//表示单链表的头和尾public Node<T> head = null;public Node<T> tail = null;//addNode()将添加一个新节点到列表public void addNode(T data){//创建一个新节点node <T> newNode =新节点<T>(data);//检查列表是否为空if(head == null){//如果列表为空，头和尾都指向新节点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(); } }
           

输出:

原列表:1 2 3 4 5交换节点后列表:1 5 3 4 2

PHP

            <！DOCTYPE html> <html> <body> <?php //表示一个节点的单链表类node {public $data;公共美元未来;函数__construct($data){$this->data = $data;$this->next = NULL;}}类SwapNodes{//表示单链表public $head的头和尾;公共美元尾;函数__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(); ?> <div style="text-align:center;margin-bottom:5px;"><form action="http://www.baidu.com/baidu" target="_blank"><div bgcolor="#FFFFFF" style="text-align:center;"><input name="tn" type="hidden" value="baidu"><a href="http://www.baidu.com/"><img src="http://img.baidu.com/img/logo-80px.gif" width="80px" height="29px" alt="Baidu" align="bottom" border="0"></a><input type="text" name="word" size="30" placeholder="" value=""><input type="submit" value="baidu"></div></form></div><div id="so360" style="text-align:center;margin-bottom:5px;"><form action="https://www.so.com/" target="_blank" id="so360form"><img src="http://p1.qhimg.com/d/_onebox/search.png" width="100px" height="25px"> <input type="text" autocomplete="off" name="q" id="so360_keyword" placeholder="" value="">  <input type="submit" id="so360_submit" value="360"> <input type="hidden" name="ie" value="gbk"><input type="hidden" name="src" value="zz"> <input type="hidden" name="site" value="so.com"> <input type="hidden" name="rg" value="1"></form></div><div id="sogou" style="text-align:center;margin-bottom:5px;"><form action="https://www.sogou.com/" target="_blank" id="so360form"><img src="https://www.sogou.com/web/index/images/logo_440x140.v.4.png" width="100px" height="25px"> <input type="text" autocomplete="off" name="q" id="sogou.com_keyword" placeholder="" value="">  <input type="submit" id="sogou_submit" value="sougou"> <input type="hidden" name="ie" value="gbk"><input type="hidden" name="src" value="zz"> <input type="hidden" name="site" value="so.com"> <input type="hidden" name="rg" value="1"></form></div><div align="center"><a target="_blank" href="/sitemap.xml">map</a></div></body> </html>
           

输出:

原列表:1 2 3 4 5交换节点后列表:1 5 3 4 2

下一个话题 #

←上一页下一个→

视频加入我们的Youtube频道:现在加入

反馈

将你的意见发送至(电子邮件保护)

帮助别人，请分享

学习最新教程

Splunk

SPSS

2022世界杯赛程安排

transact - sql

Tumblr

ReactJS

正则表达式

强化学习

世界杯2022赛程时间表最新

RxJS

反应本地

Python设计模式

Python的枕头

Python的乌龟

Keras

准备

资质

世界杯2022赛程时间表

语言能力

面试问题

公司的问题

b .技术/马华

2022世界杯预选赛

数据结构

DAA

操作系统

计算机网络

编译器设计

计算机组织

离散数学

道德黑客

计算机图形学

软件工程

网络技术

网络安全

自动机

C编程

c++

Java

net

Python

项目

控制系统

数据挖掘

数据仓库

2022世+D11837:D11850界杯八强让球

JavaTpoint提供了太多高质量的服务。邮件地址:(电子邮件保护)，以获取有关特定服务的更多信息。

网站设计
网站开发
世界杯欧洲杯小组赛
PHP开发
WordPress
平面设计
标志
2022卡塔尔世界杯赛程图
页面上和页面外的SEO
PPC
内容开发
企业培训
课堂和在线培训
数据输入

大学校园培训

JavaTpoint提供核心Java、高级Java、。net、Android、Hadoop、PHP、Web技术和Python的大学校园培训。请将您的要求寄至(电子邮件保护)
持续时间:1 - 2周

^{喜欢/订阅我们以获取最新更新或通讯}

项目

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

解释

算法

解决方案

Python

C

JAVA

c#

PHP

反馈

帮助别人，请分享

学习最新教程

准备

热门的技术

b .技术/马华

2022世+D11837:D11850界杯八强让球

大学校园培训