单向链表

单向链表

/定义一个SingleLinkedList来管理数据
class SingleLinkedList{

    //用来做链表的头节点，不放数据
    private DataNode head = new DataNode();

    //添加节点方法，非排序
    public void add(DataNode node){
        DataNode tmp = head;
        while(true){
            if(tmp.next == null){
                tmp.next = node;
                break;
            }
            tmp = tmp.next;
        }
    }

    //添加节点方法，排序(num从小到大)
    public boolean addAndOrder(DataNode node){
        DataNode tmp = head;
        while(true){
            //如果已经到链表尾端，直接向后添加
            if(tmp.next == null){
                tmp.next = node;
                break;
            }

            //需添加节点小于next，则放到tmp和next之间
            if(node.num < tmp.next.num){
                node.next = tmp.next;
                tmp.next = node;
                break;
            }

            //如果相等返回false
            if(tmp.next.num == node.num){
                return false;
            }

            tmp = tmp.next;
        }
        return true;
    }

    //修改节点
    public boolean update(DataNode node){
        DataNode tmp = head;
        while(true){
            //如果已经到链表尾端
            if(tmp.next == null){
                return false;
            }
            if(tmp.next.num == node.num){
                node.next = tmp.next.next;
                tmp.next = node;
                return true;
            }
            tmp = tmp.next;
        }
    }

    //删除节点
    public boolean delete(int num){
        DataNode tmp = head;
        while (true){
            //如果已经到链表尾端
            if(tmp.next == null){
                return false;
            }

            if(tmp.next.num == num){
                if(tmp.next.next == null){
                    tmp.next = null;
                }else {
                    tmp.next = tmp.next.next;
                }
                return true;
            }
            tmp = tmp.next;
        }
    }

    //展示链表
    public void show(){
        DataNode tmp = head;
        while(true){
            if(tmp.next == null){
                break;
            }
            System.out.println(tmp.next);
            tmp = tmp.next;
        }
    }

	//获取有效节点数量（不算头节点）
    public int size(){
        int num = 0;
        DataNode tmp = head;
        while (true){
            if(tmp.next == null){
                return num;
            }
            tmp = tmp.next;
            num++;
        }
    }

    //获取倒数第order个节点
    public DataNode getByReciprocal(int order){
        int size = size();
        int num = size - order;
        if(order <= 0 || order > size){
            return null;
        }
        DataNode tmp = head.next;
        while (true){
            if(num == 0){
                return tmp;
            }
            tmp = tmp.next;
            num--;
        }

    }

    //反转单列表
    public void reverse(){
        if(size() <= 1){
            return;
        }
        DataNode tmpHead = head.next.next;
        DataNode tmp = head.next;
        head.next = null;
        while(true){
            tmp.next = head.next;
            head.next = tmp;
            tmp = tmpHead;
            tmpHead = tmp.next;;
            if(tmpHead == null){
                tmp.next = head.next;
                head.next = tmp;
                return;
            }
        }
    }

    //逆序打印但不改变链表结构
    public void  reversePrint(){
        if(head.next == null){
            return;
        }
        Stack<DataNode> stack = new Stack<>();
        DataNode tmp = head.next;
        while(true){
            if(tmp == null){
                break;
            }
            stack.push(tmp);
            tmp = tmp.next;
        }
        while (stack.size() > 0){
            System.out.println(stack.pop());
        }

    }

}


//定义DataNode，每个DataNode对象就是一个数据节点
class DataNode<T>{
    public int num;//用来排序，这部分也可以放到data里
    public T data;//用来存放数据
    public DataNode next;//下一个节点
    public DataNode(int num,T data){
        this.num = num;
        this.data = data;
    }
    public DataNode(){}

    @Override
    public String toString() {
        return "DataNode{" + "num=" + num + ", data=" + data.toString() + '}';
    }
}