LinkedListTest

package com.qbsea.arithmetic.linked;

public class LinkedListTest {
	public static void main(String[] args) {
		//往链表里增加五个数
		LinkedList linkedList =new LinkedList();
		Node node1 = new Node();
		node1.setData("1");
		linkedList.add(node1);
		//
		Node node2 = new Node();
		node2.setData("2");
		linkedList.add(node2);
		//
		Node node3 = new Node();
		node3.setData("3");
		linkedList.add(node3);
		//
		Node node4 = new Node();
		node4.setData("4");
		linkedList.add(node4);
		//
		Node node5 = new Node();
		node5.setData("5");
		linkedList.add(node5);
		
		//开始找中间元素
		Node currentNode = linkedList.getHead();
		Node middleNode = linkedList.getHead();
		int i=1;
		while(currentNode.getNext()!=null) {
			if(i%2==0) {
				middleNode = middleNode.getNext();
			}
			currentNode = currentNode.getNext();
			i++;
		}
		System.out.println("the middleNode is "+middleNode.getData());
	}

	public static class LinkedList{
		private Node head;//头指针
		private Node tail;//尾指针
		public void add(Node node) {
			if(head==null) {
				head = node;
				tail=node;
				return ;
			}
			tail.next=node;
			tail=node;
		}
		// LinkedList的set and get method
		public Node getHead() {
			return head;
		}

		public void setHead(Node head) {
			this.head = head;
		}

		public Node getTail() {
			return tail;
		}

		public void setTail(Node tail) {
			this.tail = tail;
		}
	}
	public static class Node {
		private Node next;// 指针
		private String data;

		// set and get method
		public Node getNext() {
			return next;
		}

		public void setNext(Node next) {
			this.next = next;
		}

		public String getData() {
			return data;
		}

		public void setData(String data) {
			this.data = data;
		}
	}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值