蛋疼的递归删除无头单链表元素

import java.util.Scanner;

/**
 * Created by yueli on 2018/9/11.
 */
public class Exmple {
    class node{
        public int n;
        public node next;
    }
    public void remove(int x,node now,node prev){
        if(now!=null){
            remove(x,now.next,now);
            if(now.n==x) {
                prev.next = now.next;
                if (now==list){
                    list=list.next;
                }
            }
        }
    }
    public node list;
    Scanner scanner;
    Exmple(){
       // scanner=new Scanner(System.in);
        int a[]={1,2,8,7,6};
        list=new node();
        list.n=8;
        node p=list;
        for(int i=0;i<5;i++){
            node temp=new node();
            temp.n=a[i];
            p.next=temp;
            p=p.next;
        }
    }
    public void show(){
        node p=list;
        while (p!=null){
            System.out.print(p.n);
            p=p.next;
        }
    }
    public void showRemove(int x){
        remove(x,list,list);
        System.out.println();
        show();
    }
    public static void main(String[] args) {
         Exmple e=new Exmple();
         e.show();
         e.showRemove(8);
    }
}