Java链表的天然递归结构性质图文与实例分析

package LeetCodeSubject;
/*
 * 使用虚拟头节点
 * */

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;
    }
  }


  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 Solution()).removeElements(head, 6);
    System.out.println(res);

  }
}