递归算法的理解（以单链表逆转为实例）

单链表为1234一共进行了4次调用

 

//第四次调用
public Node reverse(Node head) {
    if (head == null || head.next == null)
        return head;//heasd =4返回4
    Node temp = head.next;//temp =4;
    Node newHead = reverse(head.next);
    temp.next = head;//
    head.next = null;//
    return newHead;//
}

//第三次调用
public Node reverse(Node head) {
    if (head == null || head.next == null)
        return head;//heasd =3
    Node temp = head.next;//temp =4;
    Node newHead = reverse(head.next);///newHead =?等代第四次调用返回
    temp.next = head;//4.next =3
    head.next = null;//3.next =1
    return newHead;///newHead =?
}

//第二次调用
public Node reverse(Node head) {
    if (head == null || head.next == null)
        return head;//heasd =2
    Node temp = head.next;//temp =3;
    Node newHead = reverse(head.next);//newHead =?//等待三返回
    temp.next = head;//3.next =2
    head.next = null;//2.next =null
    return newHead;///newHead =?
}

//第一次调用
public Node reverse(Node head) {
    if (head == null || head.next == null)
        return head;//heasd =1
    Node temp = head.next;//temp =2;
    Node newHead = reverse(head.next);//newHead =?等待第二次调用返回
    temp.next = head;//2.next =1
    head.next = null;//1.next =null
    return newHead;// newHead =?
}