本文整理汇总了Java中edu.princeton.cs.algs4.StdOut.print方法的典型用法代码示例。如果您正苦于以下问题:Java StdOut.print方法的具体用法?Java StdOut.print怎么用?Java StdOut.print使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类edu.princeton.cs.algs4.StdOut
的用法示例。
在下文中一共展示了StdOut.print方法的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
ResizingArrayQueue<String> q = new ResizingArrayQueue<String>();
while (!StdIn.isEmpty()) {
String item = StdIn.readString();
if (!item.equals("-")) q.enqueue(item);
else if (q.isEmpty()) StdOut.println("BAD INPUT");
else StdOut.print(q.dequeue() + " ");
}
StdOut.println();
// print what's left on the stack
StdOut.print("Left on queue: ");
for (String s : q) {
StdOut.print(s + " ");
}
StdOut.println();
}
示例2: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
Picture picture = new Picture(args[0]);
StdOut.printf("%s (%d-by-%d image)\n", args[0], picture.width(), picture.height());
StdOut.println();
StdOut.println("The table gives the dual-gradient energies of each pixel.");
StdOut.println("The asterisks denote a minimum energy vertical or horizontal seam.");
StdOut.println();
SeamCarver carver = new SeamCarver(picture);
StdOut.printf("Vertical seam: { ");
int[] verticalSeam = carver.findVerticalSeam();
for (int x : verticalSeam)
StdOut.print(x + " ");
StdOut.println("}");
printSeam(carver, verticalSeam, VERTICAL);
StdOut.printf("Horizontal seam: { ");
int[] horizontalSeam = carver.findHorizontalSeam();
for (int y : horizontalSeam)
StdOut.print(y + " ");
StdOut.println("}");
printSeam(carver, horizontalSeam, HORIZONTAL);
}
示例3: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
String filename = args[0];
In in = new In(filename);
int n = in.readInt();
int i = 0;
int[][] tiles = new int[n][n];
while (!in.isEmpty()) {
tiles[i/n][i%n] = in.readInt();
i++;
}
try{
Solver sv = new Solver(new Board(tiles));
StdOut.println("Minimum number of moves = "+sv.moves());
for(Board b : sv.solution())
StdOut.print(b);
}catch(java.lang.IllegalArgumentException e){
StdOut.println(e.getMessage());
}
}
示例4: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
String filename = args[0];
In in = new In(filename);
int n = in.readInt();
int i = 0;
int[][] tiles = new int[n][n];
while (!in.isEmpty()) {
tiles[i/n][i%n] = in.readInt();
i++;
}
Board b = new Board(tiles);
StdOut.print(b);
StdOut.println("Hamming = "+ b.hamming());
StdOut.println("Manhattan = "+ b.manhattan());
StdOut.println("isGoal = "+ b.isGoal());
StdOut.println("isSolvable = "+ b.isSolvable());
}
示例5: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
int max = Integer.parseInt(args[0]);
FixedCapacityStack<String> stack = new FixedCapacityStack<String>(max);
while (!StdIn.isEmpty()) {
String item = StdIn.readString();
if (!item.equals("-")) stack.push(item);
else if (stack.isEmpty()) StdOut.println("BAD INPUT");
else StdOut.print(stack.pop() + " ");
}
StdOut.println();
// print what's left on the stack
StdOut.print("Left on stack: ");
for (String s : stack) {
StdOut.print(s + " ");
}
StdOut.println();
}
示例6: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main (String[] args) {
StdOut.print("Expected: a java.util.ConcurrentModificationException to be thrown\n");
Exercise50_FailFastIterator<String> failFastIterator = new Exercise50_FailFastIterator<>();
failFastIterator.push("a");
failFastIterator.push("b");
failFastIterator.push("c");
failFastIterator.push("d");
failFastIterator.pop();
for(String string : failFastIterator) {
StdOut.print("Iterating at item " + string + " ");
failFastIterator.push("z");
}
}
示例7: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
/**
* Takes a pattern string and an input string as command-line arguments;
* searches for the pattern string in the text string; and prints
* the first occurrence of the pattern string in the text string.
*
* @param args the command-line arguments
*/
public static void main(String[] args) {
String pat = args[0];
String txt = args[1];
char[] pattern = pat.toCharArray();
char[] text = txt.toCharArray();
KMP kmp1 = new KMP(pat);
int offset1 = kmp1.search(txt);
KMP kmp2 = new KMP(pattern, 256);
int offset2 = kmp2.search(text);
// print results
StdOut.println("text: " + txt);
StdOut.print("pattern: ");
for (int i = 0; i < offset1; i++)
StdOut.print(" ");
StdOut.println(pat);
StdOut.print("pattern: ");
for (int i = 0; i < offset2; i++)
StdOut.print(" ");
StdOut.println(pat);
}
示例8: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
/**
* Takes a pattern string and an input string as command-line arguments;
* searches for the pattern string in the text string; and prints
* the first occurrence of the pattern string in the text string.
*
* @param args the command-line arguments
*/
public static void main(String[] args) {
String pat = args[0];
String txt = args[1];
RabinKarp searcher = new RabinKarp(pat);
int offset = searcher.search(txt);
// print results
StdOut.println("text: " + txt);
// from brute force search method 1
StdOut.print("pattern: ");
for (int i = 0; i < offset; i++)
StdOut.print(" ");
StdOut.println(pat);
}
示例9: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
/**
* Unit tests the <tt>DepthFirstPaths</tt> data type.
*/
public static void main(String[] args) {
In in = new In(args[0]);
Graph G = new Graph(in);
int s = Integer.parseInt(args[1]);
DepthFirstPaths dfs = new DepthFirstPaths(G, s);
for (int v = 0; v < G.V(); v++) {
if (dfs.hasPathTo(v)) {
StdOut.printf("%d to %d: ", s, v);
for (int x : dfs.pathTo(v)) {
if (x == s) StdOut.print(x);
else StdOut.print("-" + x);
}
StdOut.println();
}
else {
StdOut.printf("%d to %d: not connected\n", s, v);
}
}
}
示例10: printArray
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
private static void printArray(boolean[][] array) {
int rowsLength = array.length;
int columnsLength = array[0].length;
for (int i = 0; i < rowsLength; i++) {
for (int j = 0; j < columnsLength; j++) {
if (array[i][j]) {
StdOut.print("*");
} else{
StdOut.print(" ");
}
}
StdOut.println();
}
}
示例11: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的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);
}
}
示例12: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
BaseballElimination division = new BaseballElimination(args[0]);
for (String team : division.teams()) {
if (division.isEliminated(team)) {
StdOut.print(team + " is eliminated by the subset R = { ");
for (String t : division.certificateOfElimination(team))
StdOut.print(t + " ");
StdOut.println("}");
}
else
StdOut.println(team + " is not eliminated");
}
}
示例13: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
Teste t = new Teste();
Bag<String> bii = t.getB();
for (String s: bii)
StdOut.println(s);
StdOut.print("Hello WORLD!!!\n");
}
示例14: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
Queue<String> queue = new Queue<>();
queue.enqueue("1");
queue.enqueue("2");
queue.enqueue("3");
invertQueue(queue);
StdOut.print("Inverted queue: ");
for(String string : queue) {
StdOut.print(string + " ");
}
StdOut.println("\nExpected: 3 2 1");
}
示例15: main
import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
/**
* Unit tests the <tt>Bipartite</tt> data type.
*/
public static void main(String[] args) {
int V1 = Integer.parseInt(args[0]);
int V2 = Integer.parseInt(args[1]);
int E = Integer.parseInt(args[2]);
int F = Integer.parseInt(args[3]);
// create random bipartite graph with V1 vertices on left side,
// V2 vertices on right side, and E edges; then add F random edges
Graph G = GraphGenerator.bipartite(V1, V2, E);
for (int i = 0; i < F; i++) {
int v = StdRandom.uniform(V1 + V2);
int w = StdRandom.uniform(V1 + V2);
G.addEdge(v, w);
}
StdOut.println(G);
Bipartite2 b = new Bipartite2(G);
if (b.isBipartite()) {
StdOut.println("Graph is bipartite");
for (int v = 0; v < G.V(); v++) {
StdOut.println(v + ": " + b.color(v));
}
}
else {
StdOut.print("Graph has an odd-length cycle: ");
for (int x : b.oddCycle()) {
StdOut.print(x + " ");
}
StdOut.println();
}
}