java—链表反转

关键代码块

private void reverseMyList(Node currentNode) {
            Node tmpNode=null;
            if(current==null||current.next==null){
                return ;
            }
            while(current.next!=null){
                tmpNode=currentNode.next;//保存下一个节点
                currentNode.next=pre;//重置
                pre=currentNode;
                current=tmpNode;
            }
            current.next=pre;

            //输出反转之后的链表
            while(current!=null){
                System.out.print(current.getData()+" ");
                current=current.next;
            }
            System.out.println();

        }

猜你喜欢

转载自blog.csdn.net/yurong33333/article/details/84404935