给一个链表，输出去掉第k个节点的链表

class ListNode{
	public int val;
	public ListNode next;
	public ListNode(int val) {
		this.val = val;
	}
}
public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int k = scanner.nextInt();
		int[] arrays = new int[n];
		for (int i = 0; i < n; i++) {
			int a = scanner.nextInt();
			arrays[i] = a;
		}
		ListNode head = createListBode(arrays);
		ListNode head1 = removeNode(head, k);
		while (head1!=null) {
			System.out.print(head1.val+" ");
			head1 = head1.next;
		}
	}
	//执行删除方法
	public static ListNode removeNode(ListNode head,int k) {
		ListNode listNode = head;
		for (int i = 0; i < k-2; i++) {
			if (listNode.next!=null) {
				listNode = listNode.next;
			}else {
				return head;
			}
		}
		listNode.next = listNode.next.next;
		return head;
	}
	//开始创建链表
	public static ListNode createListBode(int[] arrays) {
		ListNode head = new ListNode(arrays[0]);
		ListNode listNode = head;
		for (int i = 1; i < arrays.length; i++) {
			ListNode next = new ListNode(arrays[i]);
			listNode.next = next;
			listNode = listNode.next;
		}
		return head;
	}

}