數據結構與算法15-鏈表-單鏈表

 單鏈表的查找和刪除以及顯示

正確使用指針

class Link{
	public int iData;
	public double dData;
	public Link next;
	public Link(int id,double dd)
	{
		iData = id;
		dData = dd;
	}
	public void displayLink()
	{
		System.out.println("{" + iData + "," +dData + "}");
		
	}
}
class LinklList {
	private Link first;
	public LinklList()
	{
		first = null;
	}
	public boolean isEmpty()
	{
		return (first == null);
	}
	public void insertFirst(int id,double dd)
	{
		Link newLink = new Link(id,dd);
		newLink.next = first;
		first = newLink;
	}
	public Link deleteFirst()
	{
		Link temp = first;
		first = first.next;
		return temp;
	}
	public void displayList()
	{
		System.out.println("list");
		Link current = first;
		while(current!=null)
		{
			current.displayLink();
			current = current.next;
		}
		System.out.println(" ");
	}
}
class LinkListApp
{
	public static void main(String[] args)
	{
		LinklList theList = new LinklList();
		theList.insertFirst(22, 2.99);
		theList.insertFirst(44, 4.99);
		theList.insertFirst(66, 6.99);
		theList.insertFirst(88, 8.99);
		theList.displayList();
		while(!theList.isEmpty())
		{
			Link aLink = theList.deleteFirst();
			System.out.println("delete");
			aLink.displayLink();
			System.out.println(" ");
		}
		theList.displayList();
	}
}

list
{88,8.99}
{66,6.99}
{44,4.99}
{22,2.99}
 
delete
{88,8.99}
 
delete
{66,6.99}
 
delete
{44,4.99}
 
delete
{22,2.99}
 
list