反转单链表和双链表

单链表:

用一个临时变量节点temp保存当前节点的下一个节点,当前节点的下一个节点指向前节点pre,pre便成为当前节点,当前节点便成为temp

双链表:

和单链表情况类似,用temp节点保存当前节点的下一个节点,当前节点的下一个节点指向前节点pre,当前节点的上一个节点指向temp节点(已保存好的下一个节点),pre往右走便成为当前节点,当前节点往右走便成为temp

code:

public class RevrseLinkedList {
	public static class Node{
		public int value;
		public Node next;
		
		public Node(int data) {
			this.value = data;
		}
	}
	
	public static Node reverseList(Node cur) {
		Node pre = null; //前结点
		Node temp = null;  //临时变量保存当前结点的后结点
		
		while(cur != null) {
			temp = cur.next;
			cur.next = pre;
			pre = cur;
			cur = temp;
		}
		return pre;
	}public class RevrseLinkedList {
		public static class Node{
			public int value;
			public Node next;
			
			public Node(int data) {
				this.value = data;
			}
		}
		
		public static Node reverseList(Node cur) {
			Node pre = null; //前结点
			Node temp = null;  //临时变量保存当前结点的后结点
			
			while(cur != null) {
				temp = cur.next;
				cur.next = pre;
				pre = cur;
				cur = temp;
			}
			return pre;
		}
		
		
		public static void printLinkedList(Node head) {
			System.out.println("Linked List:");
			while(head != null) {
				System.out.print(head.value + " ");
				head = head.next;
			}
			System.out.println();
		}
		
		
		public static class DoubleNode{
			public int value;
			public DoubleNode last;
			public DoubleNode next;
			
			public DoubleNode(int data) {
				this.value = data;
			}
		}
		
		public static DoubleNode reverseListD(DoubleNode cur) {
			DoubleNode pre = null;
			DoubleNode temp = null;
			while(cur != null) {
				temp = cur.next;
				cur.next = pre;
				cur.last = temp;
				pre = cur;
				cur = temp;
			}
			return pre;
		}
		
		public static void printDoubleLinkedList(DoubleNode head) {
			System.out.print("Double Linked List:");
			DoubleNode end = null;
			while(head != null) {
				System.out.print(head.value + " ");
				end = head;
				head = head.next;
			}
			System.out.print("| ");
			while(end != null) {
				System.out.print(end.value + " ");
				end = end.last;
			}
			System.out.println();
		}
		
		public static void main(String[] args) {
			Node head1 = new Node(1);
			head1.next = new Node(2);
			head1.next.next = new Node(3);
			printLinkedList(head1);
			head1 = reverseList(head1);
			printLinkedList(head1);
			
			
			DoubleNode head2 = new DoubleNode(1);
			head2.next = new DoubleNode(2);
			head2.next.last = head2;
			head2.next.next = new DoubleNode(3);
			head2.next.next.last = head2.next;
			head2.next.next.next = new DoubleNode(4);
			head2.next.next.next.last = head2.next.next;
			printDoubleLinkedList(head2);
			printDoubleLinkedList(reverseListD(head2));
		}
	
	
	public static void printLinkedList(Node head) {
		System.out.println("Linked List:");
		while(head != null) {
			System.out.print(head.value + " ");
			head = head.next;
		}
		System.out.println();
	}
	
	
	public static class DoubleNode{
		public int value;
		public DoubleNode last;
		public DoubleNode next;
		
		public DoubleNode(int data) {
			this.value = data;
		}
	}
	
	public static DoubleNode reverseListD(DoubleNode cur) {
		DoubleNode pre = null;
		DoubleNode temp = null;
		while(cur != null) {
			temp = cur.next;
			cur.next = pre;
			cur.last = temp;
			pre = cur;
			cur = temp;
		}
		return pre;
	}
	
	public static void printDoubleLinkedList(DoubleNode head) {
		System.out.print("Double Linked List:");
		DoubleNode end = null;
		while(head != null) {
			System.out.print(head.value + " ");
			end = head;
			head = head.next;
		}
		System.out.print("| ");
		while(end != null) {
			System.out.print(end.value + " ");
			end = end.last;
		}
		System.out.println();
	}
	
	public static void main(String[] args) {
		Node head1 = new Node(1);
		head1.next = new Node(2);
		head1.next.next = new Node(3);
		printLinkedList(head1);
		head1 = reverseList(head1);
		printLinkedList(head1);
		
		
		DoubleNode head2 = new DoubleNode(1);
		head2.next = new DoubleNode(2);
		head2.next.last = head2;
		head2.next.next = new DoubleNode(3);
		head2.next.next.last = head2.next;
		head2.next.next.next = new DoubleNode(4);
		head2.next.next.next.last = head2.next.next;
		printDoubleLinkedList(head2);
		printDoubleLinkedList(reverseListD(head2));
	}
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值