002-在单链表和双链表中删除倒数第k个结点

package com.my.util;
/**
 * 链表结点
 * */
public class LinkNode {
	public int value;
	public LinkNode next;
	public LinkNode(int value) {
		this.value = value;
	}
}

package com.my.util;
/**
 * 双链表结点
 * */
public class DoubleNode {
	public int value;
	public DoubleNode next;
	public DoubleNode last;
	public DoubleNode(int value) {
		this.value = value;
	}
}

package com.my.suanfa;

import com.my.util.DoubleNode;
import com.my.util.LinkNode;

/**
 * 在单链表和双链表中删除倒数第k个结点
 * */
public class Solution08 {
	/**
	 * 单链表中删除第k个结点
	 * */
	public LinkNode removeLastKthNode(LinkNode head, int lastKth) {
		//边界条件判断
		if(head == null || lastKth <1) {
			return head;
		}
		//定义一个指针指向头结点
		LinkNode cur = head;
		while(cur != null) {
			//先从头到尾遍历一遍链表，每向后移动一次指针，lastKth--
			lastKth--;
			cur = cur.next;
		}
		if(lastKth == 0) {
			//如果lastKth==0,说明头结点就是要删除的结点，就将头结点抛弃
			head = head.next;
		} 
		if(lastKth < 0) {
			//如果lastKth<0说明存在要删除的结点，，在次从头到尾遍历链表，每次移动指针让lastkth++,当lastkth==0时，此节点就是要删除节点的上一个结点
			//因为经历一次遍历，cur已经不再指向头结点，因此让cur重新指向头结点
			cur = head;
			while(++lastKth != 0) {
				cur = cur.next;
			}
			cur.next = cur.next.next;
		}
		return head;
	}
	
	/**
	 * 双链表中删除第k个结点
	 * */
	public DoubleNode removeLastKthNode(DoubleNode head, int lastKth) {
		//边界条件判断
		if(head == null || lastKth < 1) {
			return head;
		}
		DoubleNode cur = head;
		while(cur != null) {
			lastKth--;
			cur = cur.next;
		}
		if(lastKth == 0) {
			head = head.next;
			//头结点的向前的指针为空
			head.last = null;
		}
		if(lastKth < 0) {
			cur = head;
			while(++lastKth != 0) {
				cur = cur.next;
			}
			//定义一个新节点来记录要删除节点的下一个节点
			DoubleNode newNext = cur.next.next;
			cur.next = newNext;
			if(newNext != null) {
				newNext.last = cur;
			}
		}
		return head;
	}
}