java实现单链表

public class Node {

	public Node(int val){
		this.val = val;
		this.next = null;
	};
	Node next;
	protected int val;
}

package hello;

public class MyLink {
	Node head;
	int linksize;
	
	public MyLink() {
		head = null;
		linksize = 0;
	}
	
	public MyLink(int val) {
		head = new Node(val);
		linksize = 1;
	}
	
	//尾插法
	public void insertNail(int val) {
		Node node = new Node(val);
		if(head==null) {
			head = node;
		}
		else {
			Node q = head;
			while(q.next!=null) {
				q = q.next;
			}
			q.next = node;
		}
		linksize ++;
	}
	
	//头插法
	public void insertHead(int val) {
		Node node = new Node(val);
		if(head==null) {
			head = node;
		}else {
			node.next = head;
			head = node;
		}
		linksize ++;
	}
	
	//按照索引删除节点
	public void delIndex(int index) {
		Node p = head;
		if(index == 0) {
			head = head.next;
			p.next = null;
		}else if(index == -1 ){
			if(p.next==null) head=null;
			while(p.next.next!=null) p = p.next;
			p.next = null;
		}else {
			index -=1;//越过头结点
			Node q = p.next;
			while(index-- >0) {
				p = p.next;
				q = q.next;
			}
			p.next = q.next;
			q.next = null;
		}
		linksize --;
	}
	
	//是否为空
	public boolean isEmpty() {
		return linksize ==0;
	}
	//链表长度
	public int size() {
		return linksize;
	}
	
	//清空链表
	public void clear() {
		head = null;
		linksize = 0;
	}
	
	//倒序打印链表
	public Node reversePrint(Node head) {
		if(head == null || head.next ==null) return head;
		Node p =head; //上一个节点
		Node q = head.next;//当前节点
		Node temp; //练市节点，报错q的下一个节点
		while(q!=null) {
			temp = q.next;
			q.next = p;
			p =q;
			q = temp;
		}
		head.next=null;
		return p;
	}
	

	//打印列表
	private void myprint() {
		if (head==null) return;
		Node p =head;
		System.out.print(p.val+" ");
		while(p.next!=null) {
			System.out.print(p.next.val +" ");
			p = p.next;
		}
	}

	//指定下标位置插入节点
	public boolean insert(int k, Node node) {
		if(k<0 || k> linksize-1) {
			return false;
		}
		if(k == 0) {
			node.next = head;
			head = node;
			linksize++;
			return true;
		}
		Node p =head;
		int i = 1;
		while(i<k) {
			p = p.next;
			i++;
		}
		node.next = p.next;
		p.next = node;
		linksize++;
		return true;
		
	}
	//查询下标为k的节点
	public Node query(int k) {
		if (k<0 ||k>linksize-1) return null;
		if (k==0) return head;
		Node p =head;
		int i =0;
		while(p.next!=null) {
			p = p.next;
			i++;
			if (i==k) {
				return p; 
			}
		}
		return null;
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		MyLink t = new MyLink();
		/*
		 * 
		for(int i = 0 ; i < 50 ;i ++) {
			if(i%2==0) t.insertHead(i);
			else t.insertNail(i);
		}
		t.reversePrint();
		System.out.println(t.size());
		for(int i = 0 ; i < 10 ; i ++) {
			t.delIndex(i+5);
		}
		t.delIndex(-1);
		t.reversePrint();
		System.out.println(t.size());
		*/
		System.out.println("============");
		for(int i = 0 ; i < 10 ;i ++) {
			t.insertNail(i);
		}
		t.myprint();
		System.out.println();
		System.out.println(t.size());
		t.insert(4, new Node(20));
		t.myprint();
		System.out.println();
		System.out.println(t.query(4).val);
		System.out.println(t.query(4));
		System.out.println(t.size());
		Node res = t.reversePrint(t.query(0));
		System.out.print(res.val +" ");
		while(res.next!=null) {
			res = res.next;
			System.out.print(res.val+ " ");
		}

	}

}