玩转数据结构 第三章（链表）

链表：真正的动态的数据结构，最简单的的动态数据结构，具有递归结构的性质

数组个链表的对比：
数组最好用于有索引语意的情况
最大优点：支持快速查询

链表不适合用于索引有语意的情况
最大优点：动态

数据储存在节点"Node"中

class Node{
	E e;
	Node next;
}

实现链表的数据结构

package 数据结构与算法;

public class LinkedList<E> {
	
	private class Node {
		public E e;
		public Node next;
		
		public Node(E e, Node next) {
			this.e = e;
			this.next = next;
		}
		
		public Node(E e) {
			this(e,null);
		}
		
		public Node() {
			this(null, null);
		}
		
		@Override
		public String toString() {
			return e.toString();
		}
	}
	
	private Node dummyHead;
	int size;
	
	public LinkedList(){
		dummyHead = new Node(null,null);
		size = 0;
	}
	
	//获取链表中的元素个数
	public int getSize() {
		return size;
	}
	
	//返回链表是否为空
	public boolean isEmpty() {
		return size == 0;
	}
	
	//在链表的index（0-based）处添加元素e
	//在链表中不长用，练习用
	public void add(int index, E e) {
		if(index<0 || index>size) {
			throw new IllegalArgumentException("add failed. Illeage index.");
		}
		
		Node prev = dummyHead;
		for(int i = 0; i < index; i ++) {
			prev = prev.next;
		}
		
//		Node node = new Node(e);
//		node.next = prev.next;
//		prev.next = node;
		prev.next = new Node(e,prev.next);
		
		size ++;
	}
	
	//在链表头部添加一个新的元素e
	public void addFirst(E e) {
		add(0,e);
	}
	
	//在链表末尾添加元素e
	public void addLast(E e) {
		add(size,e);
	}
	
	//获得链表中第index（0-based）个位置的元素
	//在链表中不长用，练习用：
	public E get(int index) {
		if(index<0 || index > size) {
			throw new IllegalArgumentException("Get failed. Illegal index");
		}
		Node cur = dummyHead.next;
		for(int i = 0; i < index; i ++) {
			cur = cur.next;
		}
		return cur.e;
	}
	
	//获得链表的第一个元素
	public E getFirst() {
		return get(0);
	}
	
	//获得链表的最后一个元素
	public E getLast() {
		return get(size - 1);
	}
	
	//修改index位置的链表元素
	//不常用，练习：
	public void set(int index, E e) {
		if(index<0 || index > size) {
			throw new IllegalArgumentException("Set failed. Illegal index");
		}
		
		Node cur = dummyHead.next;
		for (int i = 0; i < index; i ++) {
			cur = cur.next;
		}
		cur.e = e;
	}
	
	//查找链表中是否存在元素e
	public boolean contains(E e) {
		Node cur = dummyHead.next;
		
		while (cur.e != null) {
			if (cur.e.equals(e)) {
				return true;
			}
			cur = cur.next;
		}
		return false;
	}
	
	//从链表中删除index位置的元素，并且返回这个值
	//在链表中是不常用的操作，练习使用：
	public E remove(int index) {
		if(index<0 || index >= size) {
			throw new IllegalArgumentException("Set failed. Illegal index");
		}
		
		Node prev = dummyHead;
		for (int i = 0; i < index; i ++) {
			prev = prev.next;
		}
		Node retNode = prev.next;
		prev.next = retNode.next;
		retNode.next = null;
		size --;
		
		return retNode.e;
	}
	
	//从链表中删除第一个元素
	public E removeFirst() {
		return remove(0);
	}
	
	//从链表中删除最后一个元素
	public E removeLast() {
		return remove(size - 1);
	}

	@Override
	public String toString() {
		StringBuilder res= new StringBuilder();
		
		Node cur = dummyHead.next;
		while (cur != null) {
			res.append(cur + "->");
			cur = cur.next;
		}
		res.append("NULL");
		return res.toString();
	}
	
}

试用链表实现栈：

package 数据结构与算法;

public class LinkedListStack<E> implements Stack<E> {
	private LinkedList<E> list;
	
	public LinkedListStack() {
		list = new LinkedList<>();
	}
	
	@Override
	public int getSize() {
		return list.getSize();
	}
	
	@Override
	public boolean isEmpty() {
		return list.isEmpty();
	}
	
	@Override
	public void push(E e) {
		list.addFirst(e);
	}
	
	@Override
	public E pop() {
		return list.removeFirst();
	}
	
	@Override
	public E peek() {
		return list.getFirst();
	}
	
	@Override
	public String toString() {
		StringBuilder res = new StringBuilder();
		res.append("Stack: top");
		res.append(list);
		return res.toString();
	}
	
	public static void main(String[] args) {
		LinkedListStack<Integer> stack = new LinkedListStack<>();
		
		for (int i = 0; i < 5; i ++) {
			stack.push(i);
			System.out.println(stack);
		}
		
		stack.pop();
		System.out.println(stack);

	}
}

使用链表实现队列：

package 数据结构与算法;
//使用链表实现队列
public class LinkedListQueue<E> implements Queue<E> {
	
	//创建链表节点类
	private class Node {
		public E e;
		public Node next;
		
		public Node(E e, Node next) {
			this.e = e;
			this.next = next;
		}
		
		public Node(E e) {
			this(e,null);
		}
		
		public Node() {
			this(null, null);
		}
		
		@Override
		public String toString() {
			return e.toString();
		}
	}
	
	private Node head,tail;
	private int size;
	
	public LinkedListQueue() {
		head = null;
		tail = null;
		size = 0;
	}
	
	@Override
	public int getSize() {
		return size;
	}
	
	@Override
	public boolean isEmpty() {
		return size == 0;
	}
	
	@Override
	public void enqueue(E e) {
		if(tail == null) {
			tail = new Node(e);
			head = tail;
		}else {
			tail.next = new Node(e);
			tail = tail.next;
		}
		size ++;
	}
	
	@Override
	public E dequeue() {
		if (isEmpty()) {
			throw new IllegalArgumentException("Cannot dequeue from an empty queue.");
		}
		
		Node retNode = head;
		head = head.next;
		retNode.next = null;
		if(head == null) {
			tail = null;
		}
		size --;
		return retNode.e;
	}
	
	@Override
	public E getFront() {
		if(isEmpty()) {
			throw new IllegalArgumentException("Cannot dequeue from an empty queue.");
		}else {
			return head.e;
		}
	}
	
	@Override
	public String toString() {
		StringBuilder res = new StringBuilder();
		
		res.append("Queue:front");
		Node cur = head;
		while(cur != null) {
			res.append(cur + "->");
			cur = cur.next;
		}
		res.append("Null tail");
		return res.toString();
	}
	
	public static void main(String[] args) {
		LinkedListQueue<Integer> queue = new LinkedListQueue<>();
		
		for(int i = 0; i < 10; i ++) {
			queue.enqueue(i);
			System.out.println(queue);
			if(i % 3 == 2) {
				queue.dequeue();
				System.out.println(queue);
			}
		}

	}
}