Java Stack类代码示例

OGeek|极客世界-中国程序员成长平台 › 门户 › 编程› Java›Java编程经验

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了Java中edu.princeton.cs.algs4.Stack类的典型用法代码示例。如果您正苦于以下问题：Java Stack类的具体用法？Java Stack怎么用？Java Stack使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

Stack类属于edu.princeton.cs.algs4包，在下文中一共展示了Stack类的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: BruteCollinearPoints

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
public BruteCollinearPoints(Point[] points) {
    if (points == null || hasNull(points) || hasDuplicate(points)) throw new IllegalArgumentException();

    Stack<LineSegment> segmentstack = new Stack<>();
    int N = points.length;

    for (int i = 0; i < N; i++) {
        for (int j = i+1; j < N; j++) {
            for (int k = j+1; k < N; k++) {
                for (int l = k+1; l < N; l++) {
                    Point[] ps = {points[i], points[j], points[k], points[l]};
                    Arrays.sort(ps);
                    if (collinear(ps)) segmentstack.push(new LineSegment(ps[0], ps[3]));
                }
            }
        }
    }

    int size = segmentstack.size();
    segments = new LineSegment[size];
    for (int i = 0; i < size; i++) this.segments[i] = segmentstack.pop();
}

开发者ID:SkullTech，项目名称:algorithms-princeton，代码行数:23，代码来源:BruteCollinearPoints.java

示例2: searchValidWords

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private void searchValidWords(int v, Node x, String prefix, Stack<Integer> visitingDices) {
	if (prefix.length() > 2 && x != null && x.val == 1) {
		validWords.add(prefix);
	}	
	for (int w : adj[v]) {	
		char c = getLetterOnBoard(w);
		if (!marked[w] && x != null && x.next[c -'A'] != null) {
			visitingDices.push(w);
			marked[w] = true;
			if (c == 'Q') {	
				searchValidWords(w, x.next['Q'-'A'].next['U' - 'A'], prefix + "QU", visitingDices);
			}					
			else {
				searchValidWords(w, x.next[c -'A'], prefix + c, visitingDices);
			}
			int index = visitingDices.pop();
			marked[index] = false;			
		} 
	}
}

开发者ID:Lxinyuelxy，项目名称:Princeton_Algorithms，代码行数:21，代码来源:BoggleSolver.java

示例3: solveExpressionOnTopOfStack

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static void solveExpressionOnTopOfStack(Stack<Double> values, String lastOperand) {
    //Pop, evaluate and push result
    double value = values.pop();
    if (lastOperand.equals("+")) {
        value = values.pop() + value;
    } else if (lastOperand.equals("-")) {
        value = values.pop() - value;
    } else if (lastOperand.equals("*")) {
        value = values.pop() * value;
    } else if (lastOperand.equals("/")) {
        value = values.pop() / value;
    } else if (lastOperand.equals("sqrt")) {
        value = Math.sqrt(value);
    }
    values.push(value);
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:17，代码来源:Exercise51_ExpressionEvaluation.java

示例4: main

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
public static void main(String[] args) {
	Stack<String> stack = new Stack<>();
	stack.push("First Item");
	stack.push("Second Item");
	stack.push("Third Item");
	
	Stack<String> copy = copy(stack);
	stack.pop();
	stack.pop();
	
	for (String s : copy) {
		StdOut.println(s);
	}

	StdOut.println("\nExpected: " +
               "\nThird Item\n" +
               "Second Item\n" +
               "First Item");
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:20，代码来源:Exercise12.java

示例5: FastCollinearPoints

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
public FastCollinearPoints(Point[] points) {
    if (points == null || hasNull(points) || hasDuplicate(points)) throw new IllegalArgumentException();

    Stack<Point[]> segmentstack = new Stack<>();
    int N = points.length;
    Arrays.sort(points);
    Point[] basePoints = points.clone();

    for (Point base : basePoints) {
        Comparator<Point> slopeorder = base.slopeOrder();
        Arrays.sort(points, slopeorder);

        for (int j = 1; j < N; j++) {
            int c = 1;
            while (j + c < N && collinear(new Point[]{base, points[j], points[j + c]})) { c++; }
            if (c > 2) {
                segmentstack.push(new Point[]{base, points[j + c - 1]});
            }
        }
    }

    int size = segmentstack.size();
    Point[][] segments = new Point[size][2];
    for (int i = 0; i < size; i++) segments[i] = segmentstack.pop();

    this.segments = filterSegments(segments);
}

开发者ID:SkullTech，项目名称:algorithms-princeton，代码行数:28，代码来源:FastCollinearPoints.java

示例6: filterSegments

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static LineSegment[] filterSegments(Point[][] segments) {
    Stack<LineSegment> filtered = new Stack<>();
    int N = segments.length;

    for (int i = 0, c = 0; i < N; i++, c = 0) {
        Point[] cur = segments[i], comp, longest = cur;
        if (cur == null) { continue; }

        while (c < N) {
            comp = segments[c];

            if (comp != null && isSame(cur, comp)) {
                Point[] ps = {longest[0], longest[1], comp[0], comp[1]};
                Arrays.sort(ps);
                if(longest[0] != ps[0] || longest[1] != ps[3]) longest = new Point[] {ps[0], ps[3]};
                segments[c] = null;
            }

            c++;
        }
        segments[i] = null;
        filtered.push(new LineSegment(longest[0], longest[1]));
    }

    int size = filtered.size();
    LineSegment[] maximals = new LineSegment[size];
    for (int i = 0; i < size; i++) maximals[i] = filtered.pop();
    return maximals;
}

开发者ID:SkullTech，项目名称:algorithms-princeton，代码行数:30，代码来源:FastCollinearPoints.java

示例7: main

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
public static void main(String[] args) {
    Stack<String> stack = new Stack<>();

    while (!StdIn.isEmpty()) {
        String s = StdIn.readString();
        if (s.equals("-")) StdOut.print(stack.pop());
        else stack.push(s);
    }
}

开发者ID:SkullTech，项目名称:algorithms-princeton，代码行数:10，代码来源:Main.java

示例8: getAllValidWords

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
public Iterable<String> getAllValidWords(BoggleBoard board) {
	this.board = board;
	rows = board.rows();
	cols = board.cols();
	adj = (Bag<Integer>[]) new Bag[rows*cols];	
	
	for (int i = 0; i < rows; i++) {
		for (int j = 0; j < cols; j++) {
			int v = i*cols + j;
			adj[v] = new Bag<Integer>();
			if (checkWIsValid(i-1, j)) adj[v].add((i-1) * cols + j);
			if (checkWIsValid(i+1, j)) adj[v].add((i+1) * cols + j);
			if (checkWIsValid(i, j+1)) adj[v].add(i * cols + j+1);
			if (checkWIsValid(i, j-1)) adj[v].add(i * cols + j-1);
			if (checkWIsValid(i+1, j-1)) adj[v].add((i+1) * cols + j-1);
			if (checkWIsValid(i+1, j+1)) adj[v].add((i+1) * cols + j+1);
			if (checkWIsValid(i-1, j-1)) adj[v].add((i-1) * cols + j-1);
			if (checkWIsValid(i-1, j+1)) adj[v].add((i-1) * cols + j+1);
		}
	}
	validWords = new SET<String>();
	for (int v = 0; v < rows*cols; v++) {
		visitingDices = new Stack<Integer>();
		marked = new boolean[rows*cols];
		visitingDices.push(v);
		marked[v] = true;
		if(getLetterOnBoard(v) == 'Q')
			searchValidWords(v, root.next['Q'-'A'].next['U' - 'A'], "QU", visitingDices);
		else
			searchValidWords(v, root.next[getLetterOnBoard(v)-'A'], getLetterOnBoard(v) + "", visitingDices);
	}
	return validWords;
}

开发者ID:Lxinyuelxy，项目名称:Princeton_Algorithms，代码行数:34，代码来源:BoggleSolver.java

示例9: getPath

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private int[] getPath(Pos T) {
    Stack<Pos> s = new Stack<>();
    for (Pos at = edgeTo[T.y][T.x]; at != null; at = edgeTo[at.y][at.x])
        s.push(at);
    s.pop();
    int[] ret = new int[height()];
    for (int j = 0; !s.isEmpty(); j++)
        ret[j] = s.pop().x;
    return ret;
}

开发者ID:robotenique，项目名称:intermediateProgramming，代码行数:11，代码来源:SeamCarver.java

示例10: getPathH

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private int[] getPathH(Pos T) {
    Stack<Pos> s = new Stack<>();
    for (Pos at = edgeTo[T.y][T.x]; at != null; at = edgeTo[at.y][at.x])
        s.push(at);
    if(!s.isEmpty())
        s.pop();
    int[] ret = new int[width()];
    for (int j = 0; !s.isEmpty(); j++)
        ret[j] = s.pop().y;
    return ret;
}

开发者ID:robotenique，项目名称:intermediateProgramming，代码行数:12，代码来源:SeamCarver.java

示例11: invertQueue

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static void invertQueue(Queue<String> queue) {
	Stack<String> stack = new Stack<>();
	
	while (!queue.isEmpty()) {
		stack.push(queue.dequeue());
	}
	
	while(!stack.isEmpty()) {
		queue.enqueue(stack.pop());
	}
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:12，代码来源:Exercise6.java

示例12: checkAndSolveExpressionWaitingParenteshisResult

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static void checkAndSolveExpressionWaitingParenteshisResult(Stack<String> operators, Stack<Double> values) {
    String operatorBeforeExpression = operators.peek();

    if (operatorBeforeExpression.equals("*")
            || operatorBeforeExpression.equals("/")
            || operatorBeforeExpression.equals("sqrt")) {
        operators.pop();
        solveExpressionOnTopOfStack(values, operatorBeforeExpression);
    }
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:11，代码来源:Exercise51_ExpressionEvaluation.java

示例13: checkIfExistsAndSolveLowPrecedenceOperation

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static void checkIfExistsAndSolveLowPrecedenceOperation(Stack<String> operators, Stack<Double> values) {
    String operatorBeforeExpression = operators.peek();

    if (operatorBeforeExpression.equals("-") || operatorBeforeExpression.equals("+")) {
        operators.pop();
        solveExpressionOnTopOfStack(values, operatorBeforeExpression);
    }

}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:10，代码来源:Exercise51_ExpressionEvaluation.java

示例14: getInfixExpression

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static String getInfixExpression(String input) {
	
	Stack<String> operands = new Stack<>();
	Stack<String> operators = new Stack<>();
	
	String[] inputValues = input.split("\\s");
	
	for (String value : inputValues) {
		if (value.equals("(")){
			//do nothing
		} else if (value.equals("+") 
				|| value.equals("-") 
				|| value.equals("*") 
				|| value.equals("/")) {
			operators.push(value);
		} else if (value.equals(")")) {
			String operator = operators.pop();
			String value2 = operands.pop();
			String value1 = operands.pop();
			
			String subExpression = "( " + value1 + " " + operator + " " + value2 + " )";
			operands.push(subExpression);
		} else {
			operands.push(value);
		}
	}
	
	return operands.pop();
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:30，代码来源:Exercise9.java

示例15: isBalanced

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private boolean isBalanced(String input) {

		char[] parentheses = input.toCharArray();
		Stack<Character> stack = new Stack<>();
		
		for (char parenthesis : parentheses) {
			if (parenthesis == '('
					|| parenthesis == '['
					|| parenthesis == '{'){
				stack.push(parenthesis);
			} else {
				if (stack.isEmpty()) {
					return false;
				}
				
				char firstItem = stack.pop();
				
				if (parenthesis == ')' && firstItem != '('
						|| parenthesis == ']' && firstItem != '['
						|| parenthesis == '}' && firstItem != '{') {
					return false;
				}
			}
		}
		
		return true;
	}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:28，代码来源:Exercise4.java

示例16: decimalToBinary

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static void decimalToBinary(int n) {
	Stack<Integer> stack = new Stack<>();
	
	while (n > 0) {
		stack.push(n % 2);
		n = n / 2;
	}
	
	for (int d : stack) {
		StdOut.print(d);
	}
	StdOut.println();
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:14，代码来源:Exercise5.java

示例17: infixToPostfix

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static String infixToPostfix(String infixExpression) {
	Stack<String> operands = new Stack<>();
	Stack<String> operators = new Stack<>();
	
	String[] inputValues = infixExpression.split("\\s");
	
	for (String value : inputValues) {
		if (value.equals("(")) {
			//do nothing
		} else if (value.equals("+")
				|| value.equals("-")
				|| value.equals("*")
				|| value.equals("/")) {
			operators.push(value);
		} else if (value.equals(")")) {
			String value2 = operands.pop();
			String value1 = operands.pop();
			String operator = operators.pop();
			
			String newExpression = "( " + value1 + " " + value2 + " " + operator + " )";
			operands.push(newExpression);
		} else {
			operands.push(value);
		}
	}
	
	return operands.pop();
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:29，代码来源:Exercise10.java

示例18: Exercise49_QueueWithStacks

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
public Exercise49_QueueWithStacks() {
    head = new Stack<>();
    tail = new Stack<>();
    reverseHead = new Stack<>();
    reverseTail = new Stack<>();
    tempHead = new Stack<>();
    tempTail = new Stack<>();

    size = 0;
    isPerformingRecopy = false;
    waitingSecondRecopyPass = false;
    numberOfItemsDeletedDuringRecopy = 0;
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:14，代码来源:Exercise49_QueueWithStacks.java

示例19: performSecondRecopyPass

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private void performSecondRecopyPass() {
    waitingSecondRecopyPass = false;

    while (reverseHead.size() > numberOfItemsDeletedDuringRecopy) {
        reverseTail.push(reverseHead.pop());
    }

    Stack<Item> temp = head;
    head = reverseTail;
    reverseTail = temp;

    Stack<Item> temp2 = tail;
    tail = tempTail;
    tempTail = temp2;

    //Clear reverseHead and tempHead stacks
    while (reverseHead.size() > 0){
        reverseHead.pop();
    }
    while (tempHead.size() > 0) {
        tempHead.pop();
    }
    numberOfItemsDeletedDuringRecopy = 0;

    //Recopy process done
    isPerformingRecopy = false;
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:28，代码来源:Exercise49_QueueWithStacks.java

示例20: evaluatePostfix

import edu.princeton.cs.algs4.Stack; //导入依赖的package包/类
private static int evaluatePostfix(String postfixExpression) {
	Stack<String> operands = new Stack<>();
	Stack<String> operators = new Stack<>();
	
	String[] values = postfixExpression.split("\\s");
	for (String s : values) {
		if (s.equals("(")) {
			//do nothing
		} else if (s.equals("+")
				|| s.equals("-")
				|| s.equals("*")
				|| s.equals("/")) {
			operators.push(s);
		} else if (s.equals(")")) {
			int operand2 = Integer.parseInt(operands.pop());
			int operand1 = Integer.parseInt(operands.pop());
			String operator = operators.pop();
			
			int result = 0;
			if (operator.equals("+")) {
				result = operand1 + operand2;
			} else if (operator.equals("-")) {
				result = operand1 - operand2;
			} else if (operator.equals("*")) {
				result = operand1 * operand2;
			} else if (operator.equals("/")) {
				result = operand1 / operand2;
			}
			operands.push(String.valueOf(result));
		} else {
			operands.push(s);
		}
	}
	
	return Integer.parseInt(operands.pop());
}

开发者ID:reneargento，项目名称:algorithms-sedgewick-wayne，代码行数:37，代码来源:Exercise11.java

注：本文中的edu.princeton.cs.algs4.Stack类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

Java ValidationComplete类代码示例发布时间：2022-05-22

Java RepositoryBrowser类代码示例发布时间：2022-05-22

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：18290|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9682|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8181|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8552|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8461|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9397|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8432|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7867|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8416|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7394|2022-11-06

客服电话

电子邮件

Java Stack类代码示例

示例1: BruteCollinearPoints

示例2: searchValidWords

示例3: solveExpressionOnTopOfStack

示例4: main

示例5: FastCollinearPoints

示例6: filterSegments

示例7: main

示例8: getAllValidWords

示例9: getPath

示例10: getPathH

示例11: invertQueue

示例12: checkAndSolveExpressionWaitingParenteshisResult

示例13: checkIfExistsAndSolveLowPrecedenceOperation

示例14: getInfixExpression

示例15: isBalanced

示例16: decimalToBinary

示例17: infixToPostfix

示例18: Exercise49_QueueWithStacks

示例19: performSecondRecopyPass

示例20: evaluatePostfix

请发表评论

全部评论

上一篇：

下一篇：

PacktPublishing/Python-Machine-Learning-

sussillo/hfopt-matlab: A parallel, cpu-b

鲁东大学一米网:Win7系统USB驱动器RAM的操

CVE-2022-34571

emersion/go-ostatus: An OStatus library

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053