下面一段代码准确的介绍了java实现单链表逆序,具体内容就不做详解了,有需要的朋友可以直接拷贝了
package com.ckw.mianshi; /** * java 实现单链表的逆序 * @author administrator * */ public class singlelinkedreverse { class node{ int data; node next; public node(int data){ this.data = data; } } public static void main(string[] args) { singlelinkedreverse slr = new singlelinkedreverse(); node head, tail; head = tail = slr.new node(0); for(int i=1; i<10; i++){ node p = slr.new node(i); tail.next = p; tail = p; } tail = head; while(tail != null){ system.out.print(tail.data+ ); tail = tail.next; } head = reverse(head); system.out.println( ); while(head != null){ system.out.print(head.data+ ); head = head.next; } } private static node reverse(node head) { node p1,p2 = null; p1 = head; while(head.next != null){ p2 = head.next; head.next = p2.next; p2.next = p1; p1 = p2; } return p2; } } 测试结果: 0 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1 0以上是java实现单链表逆序的代码,希望大家能够喜欢。
如对本文有疑问, 点击进行留言回复!!
ScrollView和RecyclerView的滑动事件处理
配置JAVA环境+安装Android Studio全过程+踩坑记录
Android P Camera2当SD卡被拔出来自动切换到内部存储
android 多个edittext 判空监听 让Button动态是否可点击
Android开源项目滚轮选择器WheelPicker的基本用法总结
网友评论