linlist.java

来自「数据结构java--简单功能的计算器」· Java 代码 · 共 39 行

package myPackage;
public class Linlist{  //链表类
	Node head;
	Node current;
	int size;
	
	public Linlist(){
		head=current=new Node(null);
		size=0;
	}
	
	public void index(int i) throws Exception{   //查找函数
		if(i<-1||i>size){
			throw new Exception("参数错误!");
		}
		if(i==-1){
			return;
		}
		current=head.next;
		int j=0;
		while(current!=null&&j<i){
			current=current.next;
			j++;
		}
	}
	
	public void insert(int i,float num,int point,char ch,int Judgment)throws Exception{ //插入函数
		if(i<0||i>size){
			throw new Exception("参数错误!");
		}
		index(i-1);
		current.setNEXT(new Node(num,ch,point,Judgment,current.next));
		size++;
	}
	
	public int Size(){
		return size;
	}
}