014-在单链表中删除指定值的节点

package com.my.util;
/**
 * 单向链表节点
 * */
public class SingleNode {
	public int value;
	public SingleNode next;
	public SingleNode(int data){
		this.value = data;
	}
}

package com.my.suanfa;

import java.util.Stack;

import com.my.util.SingleNode;

/**
 * 在单链表中删除指定值的节点
 * */
public class Solution11 {
	/**
	 * 方法一：时间复杂度O(N),额外空间复杂的O(N)
	 * 利用栈结构存储节点
	 * */
	public SingleNode removeValue1(SingleNode head, int num) {
		Stack<SingleNode> stack = new Stack<SingleNode>();
		while(head != null) {
			if(head.value != num) {
				stack.push(head);
			}
			head = head.next;
		}
		//循环结束后head == null
		while(!stack.isEmpty()) {
			stack.peek().next = head;
			head = stack.pop();
		}
		//循环结束后head正好指向头结点
		return head;
	}
	
	/**
	 * 方法二：时间复杂度O(N),额外空间复杂度O(1)
	 * 不需要任何容器，只需要几个有限的变量直接调整原链表
	 * */
	public SingleNode removeValue2(SingleNode head, int num) {
		//找到第一个不等于num的值，该节点一定不会被删除，而且必是调整后的链表的头结点
		while(head != null) {
			if(head.value != num) {
				break;
			}
			head = head.next;
		}
		//循环结束时head指向调整后的链表的头结点
		//定义几个有限的变量完成链表的调整
		SingleNode pre = head;
		SingleNode cur = head;
		while(cur != null) {
			if(cur.value == num) {
				pre.next = cur.next;
			} else {
				pre = cur;
			}
			cur = cur.next;
		}
		//调整结束返回新链表的头结点
		return head;
	}
}