lovlist.java

软件工程实践课程的答案哦

class LOVList
{
	LOV head;
	LOV rear ;
	LOVList()
	{
		head = null;
		rear = null;
	}
	/**make the list empty*/
	public void clear()
	{
		head = null;
		rear = null;
	}
	/** add a lov node to the list
	 * @param lov the node to add*/
	public void add(LOV lov)
	{
		System.out.println("****LOV Node Add********");
		
		if(head == null)
		{
			head = lov;
			rear = head;
		}
		else
		{
			rear.next = lov;
			rear = rear.next;
		}
	//	this.print();
	}
	/**
	 * del a lov object from the list
	 * @param lov the node to del
	 */
    public void insert(LOV lov)
	{
		System.out.println("****LOV Node Add********");
		
		if(head == null)
		{  
			head = lov;
			rear = head;
		}
		else
		{
			rear.next = lov;
			rear = rear.next;
		}
	//	this.print();
	}

    
    /**
	 * @return the length of the list
	 * */
	public void del(LOV lov)
	{   System.out.println("delete "+lov.x+" "+lov.y);
		LOV ptr = head;
		LOV ptr2 = head;
		
		if(ptr==null)//empty
		{
			System.out.println("NO LOV in LOVList!");
			return;
		}
		
		else
		{
			ptr2 = ptr;
			while(ptr!=null&&!ptr.equals(lov))
			{
				ptr2 = ptr;
				ptr = ptr.next;
			}
			if(ptr==head)//first node
				head = head.next;
			else if(ptr==rear)//last
			{
				ptr2.next= ptr2.next.next;
				rear = ptr2;
			}
			else if(ptr!=null)
			{   System.out.println("ptr: "+ptr);
			System.out.println("ptr2: "+ptr2);
				ptr2.next= ptr.next;
			}
		}
	
	}
	public int getLength()
	{
		int i=0;
		for(LOV ptr = head;ptr!=null;ptr = ptr.next)
		{
			i++;
		}
		return i;
	}
	public void print()
	{
		for(LOV ptr = head;ptr!=null;ptr = ptr.next)
		{
			System.out.print(ptr.x+","+ptr.y+","+ptr.color);
			System.out.println();
		}
	}
	
}