手写LinkList

package cn.oumashu.collection;

public class Node {
	private Node previous;
	private Object obj;
	private Node next;
	
	public Node() {
		super();
	}

	public Node(Node previous, Object obj, Node next) {
		super();
		this.previous = previous;
		this.obj = obj;
		this.next = next;
	}

	public Node getPrevious() {
		return previous;
	}

	public void setPrevious(Node previous) {
		this.previous = previous;
	}

	public Object getObj() {
		return obj;
	}

	public void setObj(Object obj) {
		this.obj = obj;
	}

	public Node getNext() {
		return next;
	}

	public void setNext(Node next) {
		this.next = next;
	}

}

package cn.oumashu.collection;

public class MyLinkList {
	private Node first;
	private Node last;
	private int size;
	
	public MyLinkList() {
		super();
	}
	
	public int size() {
		return size;
	}
	
	private void rangeCheck(int index) {
		if(index<0||index>=size) {
			try {
				throw new Exception();
			} catch (Exception e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
	}
	
	public Node node(int index) {
		Node temp = null;
		if(first!=null) {
			temp = first;
			for(int i=0;i<index;i++) {
				temp = temp.getNext();
			}
		}
		return temp;
	}
	
	public void add(Object obj) {
		Node temp = new Node();
		temp.setObj(obj);
		if(first==null) {
			temp.setPrevious(null);
			temp.setNext(null);
			first = temp;
			last = temp;
		}else {
			temp.setPrevious(last);
			temp.setNext(null);
			last.setNext(temp);
			last = temp;
		}
		size++;
	}
	
	public void add(int index, Object obj) {
		rangeCheck(index);
		Node temp = node(index);
		if(temp!=null) {
			Node newNode = new Node();
			newNode.setObj(obj);
			Node pretemp = new Node();
			pretemp = (temp.getPrevious());
			newNode.setPrevious(pretemp);
			newNode.setNext(temp);
			pretemp.setNext(newNode);
			temp.setPrevious(newNode);
		}
		size++;
	}
	
	public Object get(int index) {
		rangeCheck(index);
		Node temp = node(index);
		if(temp!=null) {
			return temp.getObj();
		}
		return null;
	}
	
	public void remove(int index) {
		rangeCheck(index);
		Node temp = node(index);
		if(temp!=null) {
			Node pretemp = temp.getPrevious();
			Node nextemp = temp.getNext();
			pretemp.setNext(nextemp);
			nextemp.setPrevious(pretemp);
		}
		size--;
	}
	
	public static void main(String[] args) {
		MyLinkList list = new MyLinkList();
		list.add("a");
		list.add("b");
		System.out.println(list.get(1));
		list.add(1, "c");
		System.out.println(list.get(1));
		list.remove(1);
		System.out.println(list.get(1));
		System.out.println(list.size());
	}
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值