Java栈实现单链表反转

public void ReverseLink(){
        if (head.next == null) {
            return;
        }
        LinkHeadNode temp = head;
        Stack<LinkHeadNode> stack = new Stack<LinkHeadNode>();
        while (temp != null){
            stack.push(temp);
            temp = temp.next;
        }
        if (!stack.isEmpty()) {
            head = stack.pop();
        }
	//方式1
//        LinkHeadNode cur  = head;

        while (!stack.isEmpty()){

            LinkHeadNode node = stack.pop();
            node.next = null;
            if (node == null) {
                break;
            }
//            cur.next = node;
//            cur = node;
            add(node);//方式2，调用了自己写的方法

        }
//        return head;

    }