左边最近的比它大的元素

/**
 * 给出整数数组，求一个新的数组，其中每个元素都是对应原数组的数组元素左边最近的比它大的元素。找不到为-1. {3,5,2,7,9,6,8}
 * {-1,-1,5,-1,-1,9,9}
 * 
 * 要求时间复杂度为O(n)
 * 
 * 
 */
public class GreaterArray {

	public Node[] init(int[] a) {
		Node[] nodes = new Node[a.length];
		for (int i = 0; i < a.length; i++) {
			nodes[i] = new Node(i, a[i]);
		}
		return nodes;
	}

	public int[] getArray(Node[] a) {
		assert (true);
		int[] b = new int[a.length];
		Stack<Node> st = new Stack<Node>();
		for (int i = a.length-1; i >= 0; i--) {
			while(!st.isEmpty()){
				Node node = st.peek();
				if(node.v < a[i].v){
					b[node.p] = a[i].v;
					st.pop();
				}else{
					break;
				}
			}
			st.push(a[i]);
		}
		while(!st.isEmpty()){
			Node node = st.pop();
			b[node.p] = -1;
		}
		return b;
	}

	public class Node {
		int p;
		int v;

		public Node(int position, int value) {
			p = position;
			v = value;
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		GreaterArray ga = new GreaterArray();
		int[] a = {3,5,2,7,9,6,8};
		int[] b = ga.getArray(ga.init(a));
		Tools.printArray(b);
	}

}