反转单链表

最新推荐文章于 2022-09-21 21:52:47 发布

bluegrass986

最新推荐文章于 2022-09-21 21:52:47 发布

阅读量457

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法

本文链接：https://blog.youkuaiyun.com/bluegrass986/article/details/39343701

数据结构与算法专栏收录该内容

9 篇文章

订阅专栏

本文深入探讨了如何使用迭代法实现单链表的反转，包括定义链表节点类、实现反转函数，并通过实例展示了链表反转的过程及效果。

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

反转单链表：



class LinkNode{
	private int num;
	private LinkNode next;
	public LinkNode(){
		
	}
	public LinkNode(int num){
		this.num = num;
	}
	public int getNum() {
		return num;
	}
	public void setNum(int num) {
		this.num = num;
	}
	public LinkNode getNext() {
		return next;
	}
	public void setNext(LinkNode next) {
		this.next = next;
	}
	
}
public class ReverseLink {

	public static LinkNode reverse(LinkNode head){
		LinkNode result = new LinkNode();
		LinkNode cur = head;
		while(cur != null){
			LinkNode tmp = cur.getNext();
			cur.setNext(result.getNext());
			result.setNext(cur);
			cur = tmp;
		}
		return result.getNext();
	}
	
	public static void main(String[] args){
		LinkNode n1 = new LinkNode(5);
		LinkNode n2 = new LinkNode(6);
		LinkNode n3 = new LinkNode(9);
		LinkNode n4 = new LinkNode(15);
		LinkNode n5 = new LinkNode(78);
		LinkNode n6 = new LinkNode(39);
		n1.setNext(n2);
		n2.setNext(n3);
		n3.setNext(n4);
		n4.setNext(n5);
		n5.setNext(n6);
		printLinkNode(n1);//<span style="font-family: Arial, Helvetica, sans-serif;">5,6,9,15,78,39,</span>

		System.out.println();
		LinkNode result = reverse(n1);
		printLinkNode(result);//39,78,15,9,6,5,
		
	}

	private static void printLinkNode(LinkNode result) {
		while(result != null){
			System.out.print(result.getNum());
			System.out.print(",");
			result = result.getNext();
		}
	}
}