玩转数据结构<四> 链表与递归

根据LeetCode初步了解递归算法

• 代码实现

//listNode
public class ListNode {
        int val;
        ListNode next;
        ListNode(int x) { val = x; }
        // 链表节点的构造函数
        //使用arr为参数，建立一个链表，当前的ListNode为链表头结点
        publc ListBide(int[] arr){
            if(arr == null || arr.length == 0 ){
                throw new IllegalArgumentException("arr can not be empty");
                this.val = arr[0];
                ListNode cur = this;
                for(int i = 1;i < arr.length; i++){
                    cur.next = new ListNode(arr[i]);
                    cur = cur.next;
                }
            }
        }
        
        // 以当前节点为头结点的链表信息字符串
        @Override
        public String toString(){
            StringBuilder res = new StringBuilder();
            ListNode cur = this;
            while(cur != null){
                res.append(cur.val + "->");
                cur = cur.next;
            }
            res.append("NULL");
            return res.toString();
        }
}

//主代码
public class Solution {

    public ListNode removeElements(ListNode head,int val){
        while(head != null && head.val == val){
            ListNode delNode = head;
            head = head.next;
            delNode.next = null;
        }
        if(head == null){
            return null;
        }
        ListNode prev = head;
        while(prev.next != null){
            if(prev.next.val == val){
                ListNode delNode = prev.next;
                prev.next = delNode.next;
                delNode.next = null;
            }else{
                prev = prev.next;
            }
        }
        return head;
    }
}

//虚拟头结点写法
public class Solution {

    public ListNode removeElements(ListNode head,int val){
      
        ListNode dummyHead = new ListNode(-1);
        dummyHead.next = head;
        
        ListNode prev = dummyHead;
        while(prev.next != null){
            if(prev.next.val == val){
                ListNode delNode = prev.next;
                prev.next = delNode.next;
                delNode.next = null;
            }else{
                prev = prev.next;
            }
        }
        return dummyHead.next;
    }
}

复制代码

递归

• 示例代码

public class Sum{
    public static int sum(int[] arr){
        return sum(arr,0);
    }
    
    //计算arr[1...n)这个区间内全部数字的和]
    private static int sum(int[] arr,int l){
        if(l == arr.length){
            return 0;
        }
        return arrp[l] + sum(arr,l + 1);
    }
    public static void main(String[] args){
        int[] nums = {1,2,3,4,5,6,7,8};
        System.out.println(sum(nums));
    }
}
复制代码

链表和递归

• 代码示例

class Solution3{
    public ListNode removeElements(ListNode head,int val){
        if(head == null){
            return null;
        }
        ListNode res = removeElements(head.next,val);
        if(head.val == val){
            return res;
        }else{
            head.next = res;
            return head;
        }
           <!-- if(head == null){
            return null;
        }
        head.next = removeElements(head.next,val);
        return head.val == val ? head.next : head;
        -->
    }
    public static void main(String[] args){
        int[] nums = {1,2,6,3,4,5,6};
        ListNode head = new ListNode(nums);
        System.out.println(head);
        
        ListNode res = (new Solution3()).removeElements(head,6);
        System.out.println(res);
    }
}
复制代码

递归函数的“微观”解读

• 跟栈相似 只不过调用其余函数改成了调用自身

• 代码示例

//主代码
public class Solution {

    public ListNode removeElements(ListNode head,int val，int depth){
    
    String depthString = generateDepthString(depth);
    System.out.print(depthString);
    System.out.print("Call: remove "+ val + " in " + head);
    
    if(head == null){
        System.out.print(depthString);
        return head;
    }
    head.next = removeElements(head.next,val,depth + 1);
    System.out.print(depthString);
     System.out.print("After: remove "+ val + " in " + res);
     
     ListNode ret;
     if(head.val == val){
         ret = res;
     }else{
         head.next = res;
         ret = head;
     }
     System.out.println(depthString);
    return ret;
    }
    
    private String generateDepthString(int depth){
        StringBuilder res = new StringBuilder();
        for(int i = 0; i< depth; i++){
            res.append("--");
        }
        return res.toString();
    }
    
  
复制代码