java 实现简单的链表

 增删改查

//链表！
interface ILink<E>{  //链表接口,定义若干链表的操作
	public void add(E e); //插入数据
	public int size(); //获取链表长度
	public boolean isEmpty(); //判空
	public Object[] toArray(); //返回链表数据，用数组接收
	public E get(int index); //获取链表指定位置上的数据
	public void set(int index,E data);
	public  boolean contains(E data);
	public void remove(E data);
	public void clean();
}

class LinkImpl<E> implements ILink<E>{
	private class Node<E>{
		private E data ; 
		private Node<E> next ;
		public Node(E data) {
			this.data = data ;
		}
		public void addNode(Node<E> newNode) {
			if(this.next == null) {
				this.next = newNode ;
			}else {
				this.next.addNode(newNode);
			}
		}
		public void toArrayNode() {
			LinkImpl.this.returnData[LinkImpl.this.foot++] = this.data;
			if(this.next!=null) {
				this.next.toArrayNode();
			}
		}
		public E getNode(int index) {
			if(LinkImpl.this.foot++ == index) {
				return this.data;
			}else {
				return this.next.getNode(index);
			}
		}
		public void setNode(int index,E data) {
			if(LinkImpl.this.foot++ == index) {
				this.data = data ;
			}else {
				this.next.setNode(index, data);
			}
		}
		public boolean containsNode(E data) {
			if(this.data.equals(data)) {
				return true;
			}else {
				if(this.next == null) {
					return false;
				}else {
					return this.next.containsNode(data);
				}
			}
		}
		public void removeNode(Node previous,E data) {
			if(this.data.equals(data)) {
				previous.next = this.next;
			}else {
				if(this.next != null) {
					this.next.removeNode(this, data);
				}
			}
			
		}
	}
	
	private Node<E> root ;  //根节点
	private int count; // 记录结点个数
	private int foot;
	private Object[] returnData;
	@Override
	public void add(E e) {
		if(e == null) {
			return ; // 插入链表的数据不能为空
		}
		Node<E> newNode = new Node<E>(e);
		if(this.root == null) {
			this.root = newNode;
		}else {
			this.root.addNode(newNode);
		}
		this.count++;
	}
	@Override
	public int size() {
		return this.count;
	}
	@Override
	public boolean isEmpty() {
//		if(this.count == 0) {
//			return true;
//		}else {
//			return false;
//		}
		return this.count == 0;
	}
	@Override
	public Object[] toArray() {
		if(this.isEmpty()) {
			throw new NullPointerException("集合内容为空");
		}
		this.foot = 0;
		this.returnData = new Object[this.count]; //先开辟数组
		this.root.toArrayNode();
		return this.returnData;
	}
//	@Override
//	public String get(int index) {
//		return (String)this.toArray()[index];
//	}
	@Override
	public E get(int index) {
		if(index >= this.count) {
			throw new ArrayIndexOutOfBoundsException("不正确的数据索引");
		}
		this.foot = 0 ;
		return this.root.getNode(index);
	}
	@Override
	public void set(int index,E data) {
		if(index >= this.count) {
			throw new ArrayIndexOutOfBoundsException("不正确的数据索引");
		}
		this.foot = 0 ;
		this.root.setNode(index, data);
	}
	@Override
	public boolean contains(E data) {
		if(data == null) {
			return false;
		}
		return this.root.containsNode(data);
	}
	@Override
	public void clean() {
		this.root = null;
		this.count = 0 ;
	}
	@Override
	public void remove(E data) {
		if(this.root.data.equals(data)) {
			this.root = this.root.next;
		}else {
			this.root.next.removeNode(this.root,data);
		}
		this.count--;
	}
}


public class AlwaysDemo {
	public static void main(String args[]){
		ILink<String> link = new LinkImpl<String>();
		System.out.println("链表初始长度："+link.size());
		System.out.println("初始是链表是否为空：");
		System.out.println(link.isEmpty());
		link.add("leeki");
		link.add("mc");
		link.add("ttt");
		System.out.println("插入数据后链表的长度："+link.size());
		System.out.println("插入数据后链表是否为空：");
		System.out.println(link.isEmpty());
		Object[] result = link.toArray();
		System.out.println("链表内容");
		for(Object obj : result) {
			System.out.println(obj);
		}
		System.out.println("获取链表第三位内容：");
		System.out.println(link.get(2));
		System.out.println("获取链表第一位内容：");
		System.out.println(link.get(0));
		link.set(0, "zj");
		System.out.println("获取修改后链表第一位内容：");
		System.out.println(link.get(0));
		System.out.println("查询链表内是否包含ttt");
		System.out.println(link.contains("ttt"));
		System.out.println("移除第一位内容：");
		link.remove("ttt");  //移除ttt
		Object[] q = link.toArray();
		System.out.println("链表内容");
		for(Object obj : q) {
			System.out.println(obj);
		}
		
	}
}