链表反转

public class LinkNode {

private Node headNode;

private Node currentNode;

private int size;

public LinkNode() {
    size = 0;
    headNode = null;
    currentNode = null;
}

public Node getHeadNode() {
    return headNode;
}

public void setHeadNode(Node headNode) {
    this.headNode = headNode;
}

public Node getCurrentNode() {
    return currentNode;
}

public void setCurrentNode(Node currentNode) {
    this.currentNode = currentNode;
}

public void add(Node node) {
    if (headNode == null) {
        headNode = node;
        currentNode = headNode;
    } else {
        currentNode.setNext(node);
        currentNode=node;
    }
    size++;

}

public Node get(int i) {
    if (i < 0 || i >= size) {
        return null;
    }
    Node node = headNode;
    for (int j = 0; j <= i; j++) {
        if (j != i) {
            if (node.getNext() != null) {
                node = node.getNext();
                continue;
            } else {
                break;
            }
        } else {
            return node;
        }
    }
    return node;
}

public boolean isEmpty() {
    return headNode == null;
}

public int getSize() {
    return size;
}

public void setSize(int size) {
    this.size = size;
}

}

public class FlipList {

public static LinkNode flipList(LinkNode nodeList) {
    if (nodeList.isEmpty()) {
        return null;
    }
    Node preNode = null;
    Node currentNode = nodeList.getHeadNode();
    Node nextNode = null;
    while (currentNode != null) {
       nextNode=currentNode.getNext();
       currentNode.setNext(preNode);
       preNode=currentNode;
       currentNode=nextNode;
    }
    nodeList.setHeadNode(preNode);
    return nodeList;
}

}

private static void testFlipList() throws Exception {
LinkNode ln = new LinkNode();
for (int i = 0; i < 3; i++) {
Node node = new Node(i);
ln.add(node);
if (ln.get(i) != null) {
System.out.println(ln.get(i).getData());
} else {
System.out.println(i);
}
}
FlipList.flipList(ln);
for (int j = 0; j < ln.getSize(); j++) {
System.out.println(ln.get(j).getData());
}
TimeUnit.MILLISECONDS.sleep(11);
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值