前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >java中链表实现

java中链表实现

作者头像
闵开慧
发布2018-03-30 13:14:30
7280
发布2018-03-30 13:14:30
举报
文章被收录于专栏:闵开慧闵开慧
代码语言:javascript
复制
package linklist;

public class Node {
	public int iData;
	public double dData;
	public Node next;

	public Node(int iData, double dData) {
		this.iData = iData;
		this.dData = dData;
	}

	public void displayLink() {
		System.out.println("{" + iData + "," + dData + "}");
	}
}


package linklist;

public class LinkList {
	private Node head;

	public LinkList() {
		head = null;
	}

	public void insertFirst(int iData, double dData) {
		Node newNode = new Node(iData, dData);
		newNode.next = head;
		head = newNode;
	}

	public Node find(int key) {
		Node currentNode = head;
		while (currentNode.iData != key) {
			if (currentNode.next == null)
				return null;
			else
				currentNode = currentNode.next;
		}
		return currentNode;
	}

	public Node delete(int key) {
		Node currentNode = head;
		Node previousNode = head;
		while (currentNode.iData != key) {
			if (currentNode.next == null)
				return null;
			else {
				previousNode = currentNode;
				currentNode = currentNode.next;
			}
		}
		if (currentNode == head) {
			head = head.next;
		} else {
			previousNode.next = currentNode.next;
		}
		return currentNode;
	}

	public void displayList() {
		System.out.println("List(first-->last):");
		Node currentNode = head;
		while (currentNode != null) {
			currentNode.displayLink();
			currentNode = currentNode.next;
		}
		System.out.println();
	}

	public static void main(String[] args) {
		LinkList linkList = new LinkList();
		linkList.insertFirst(1, 12);
		linkList.insertFirst(2, 234);
		linkList.insertFirst(3, 11234);
		linkList.insertFirst(4, 2342);
		linkList.insertFirst(5, 2342);
		linkList.insertFirst(6, 234);
		linkList.insertFirst(7, 3452);
		linkList.displayList();
		Node find = linkList.find(4);
		if (find != null)
			System.out.println("The dData of the " + find.iData + " is "
					+ find.dData);
		else
			System.out.println("There is no " + find.iData);
		Node delete = linkList.delete(4);
		if (delete != null) {
			System.out.println("The dData of the " + delete.iData + " is "
					+ delete.dData);
		} else {
			System.out.println("There is no " + delete.iData);
		}
		linkList.displayList();
	}
}
本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档