java:用头插法和尾插法实现一个链表，并输出输出链表的后k个节点

1.头插法：

public void headInsert(int value) {
		ListNode newNode = new ListNode(value);
		if (head == null) {
			head = newNode;
			return;
		}
		newNode.next = head;
		head = newNode;
	}

2.尾插法：

public void tailInsert(int value) {
		ListNode newNode = new ListNode(value);
		if (head == null) {
			head = newNode;
			return;
		}
		ListNode indexNode = head;
		while (indexNode.next != null) {
			indexNode = indexNode.next;
		}
		indexNode.next = newNode;
	}

3.输出链表的后k个节点

public void findByk(int k) {
		ListNode fast = head; 
		ListNode slow = head; 
		while (fast != null && k >= 1) {
			fast = fast.next;
			k--;
		}
		while (fast != null) {
			fast = fast.next;
			slow = slow.next;
		}
		head = slow;
	}