算法导论习题：10.3-4 in JAVA

算法导论课后习题10.3-4：我们往往希望双向链表的所有元素在存储器中保持紧凑，例如，在多数组表示中占用前m个下标位置。

import java.util.Scanner;

public class ans10_3_4 {
	public static void main(String[] args){
		Scanner in=new Scanner(System.in);
		System.out.print("输入链表大小：");
		int N = in.nextInt();
		
		mlist l = new mlist(N);
		
		char c;
		int  data;
		while(true) {
			System.out.print("输入指令：");
			c = in.next().charAt(0);
			if (c == 'i') {
				System.out.println("插入数据...");	
				data = in.nextInt();
				l.Insert(data);
			} else if (c == 'd') {
				System.out.println("删除数据...");
				data = in.nextInt();
				l.Delete(data);
			} else if (c == 'p') {
				System.out.println("显示数据...");
				l.print();
			}
		}
	}	
}

class mlist {
	int[] next;
	int[] key; 
	int[] prev;
	int cap = 0;
	int head = -1;
	int free = 0;
	
	public mlist(int N) {
		// TODO Auto-generated constructor stub
		next = new int[N];
		key  = new int[N];
		prev = new int[N];
		cap = N;
	}
	
	public void Insert(int data) {
		if (free == cap) {
			System.out.println("表满了");
			return;
		}
		key[free] = data;
		prev[free] = -1;
		next[free] = head;
		if (head != -1) {
			prev[head] = free;
		}				
		head = free;	
		free++;
	}
	public void Delete(int x) {
		if(free == 0) {
			System.out.println("已经空了");
			return;
		}
		//删除index为i的元素
		int i = Search(x);		
		if (prev[i] != -1) {
			next[prev[i]] = next[i];
		}
		if (next[i] != -1) {
			prev[next[i]] = prev[i];
		}
		//如果被删除的元素不是最后一个数,用最后一个数来填补空位
		if (i < free - 1) {
			key[i] = key[free-1];
			next[i] = next[free-1];
			prev[i] = prev[free-1];
			if (prev[i] != -1) {
				next[prev[i]] = i;
			}
			if (next[i] != -1) {
				prev[next[i]] = i;
			}			
		}
		free--;
	}
	public int Search(int x) {
		for (int i = 0; i < free; i++) {
			if (this.key[i] == x) {
				return i;
			}
		}
		return -1;
	}
	public void print(){
		System.out.print("next:");
		for(int n : next) {
			System.out.print(n);
			System.out.print(" ");
		}
		System.out.println("");
		System.out.print("data:");
		for(int n : key) {
			System.out.print(n);
			System.out.print(" ");
		}
		System.out.println("");
		System.out.print("prev:");
		for(int n : prev) {
			System.out.print(n);
			System.out.print(" ");
		}
		System.out.println("");
	}
}