当前位置: 首页>>代码示例>>Java>>正文


Java StdOut.println方法代码示例

本文整理汇总了Java中edu.princeton.cs.algs4.StdOut.println方法的典型用法代码示例。如果您正苦于以下问题:Java StdOut.println方法的具体用法?Java StdOut.println怎么用?Java StdOut.println使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在edu.princeton.cs.algs4.StdOut的用法示例。


在下文中一共展示了StdOut.println方法的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: 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);

}
 
开发者ID:Lxinyuelxy,项目名称:Princeton_Algorithms,代码行数:26,代码来源:PrintSeams.java

示例2: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {

        // create initial board from file
        In in = new In(args[0]);
        int n = in.readInt();
        int[][] blocks = new int[n][n];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                blocks[i][j] = in.readInt();
        Board initial = new Board(blocks);

        // solve the puzzle
        Solver solver = new Solver(initial);

        // print solution to standard output
        if (!solver.isSolvable())
            StdOut.println("No solution possible");
        else {
            StdOut.println("Minimum number of moves = " + solver.moves());
            for (Board board : solver.solution())
                StdOut.println(board);
        }
    }
 
开发者ID:SkullTech,项目名称:algorithms-princeton,代码行数:24,代码来源:Solver.java

示例3: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {

        // create initial board from file
        In in = new In(args[0]);
        int n = in.readInt();
        int[][] blocks = new int[n][n];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                blocks[i][j] = in.readInt();
        Board initial = new Board(blocks);
        initial = new Board(new int[][] {{0, 1}, {2, 3}});
        StdOut.println(initial.twin());
        /*for (Board b: initial.neighbors()) {
            StdOut.println(b);
        }*/
    }
 
开发者ID:SkullTech,项目名称:algorithms-princeton,代码行数:17,代码来源:Board.java

示例4: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {

        // for each command-line argument
        for (String filename : args) {

            // read in the board specified in the filename
            In in = new In(filename);
            int n = in.readInt();
            int[][] tiles = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    tiles[i][j] = in.readInt();
                }
            }

            // solve the slider puzzle
            Board initial = new Board(tiles);
            Solver solver = new Solver(initial);
            StdOut.println(filename + ": " + solver.moves());
        }
    }
 
开发者ID:Lxinyuelxy,项目名称:Princeton_Algorithms,代码行数:22,代码来源:PuzzleChecker.java

示例5: 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());
    }

}
 
开发者ID:robotenique,项目名称:intermediateProgramming,代码行数:21,代码来源:Solver.java

示例6: 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();
	}
	
}
 
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:19,代码来源:Exercise11.java

示例7: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
    EdgeWeightedGraph edgeWeightedGraph = new EdgeWeightedGraph(5);
    edgeWeightedGraph.addEdge(new Edge(0, 1, 0.42));
    edgeWeightedGraph.addEdge(new Edge(0, 3, 0.5));
    edgeWeightedGraph.addEdge(new Edge(1, 2, 0.12));
    edgeWeightedGraph.addEdge(new Edge(1, 4, 0.91));
    edgeWeightedGraph.addEdge(new Edge(2, 3, 0.72));
    edgeWeightedGraph.addEdge(new Edge(3, 4, 0.8));
    edgeWeightedGraph.addEdge(new Edge(3, 4, 0.82));
    edgeWeightedGraph.addEdge(new Edge(4, 4, 0.1));

    Exercise42_Partitioning.KruskalMSTPartitioning kruskalMSTPartitioning =
            new Exercise42_Partitioning().new KruskalMSTPartitioning(edgeWeightedGraph);

    for(Edge edge : kruskalMSTPartitioning.edges()) {
        StdOut.println(edge);
    }

    StdOut.println("\nExpected:\n" +
            "1-2 0.12000\n" +
            "0-1 0.42000\n" +
            "0-3 0.50000\n" +
            "3-4 0.80000");
}
 
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:25,代码来源:Exercise42_Partitioning.java

示例8: testPopRight

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
private void testPopRight() {
    Exercise48_TwoStacksDeque<String> deque = new Exercise48_TwoStacksDeque<>();
    deque.pushRight("a");
    deque.pushRight("b");
    deque.pushRight("c");

    deque.popRight();
    deque.popRight();

    StringJoiner dequeItems = new StringJoiner(" ");
    for (String item : deque) {
        dequeItems.add(item);
    }

    StdOut.println("Test Pop Right: " + dequeItems.toString());
    StdOut.println("Expected: a");
}
 
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:18,代码来源:Exercise48_TwoStacksDeque.java

示例9: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {

        Comparable[][] names1 = generateArray1();
        String name1 = checkIfThereAreCommonNames(names1);

        StdOut.print("Check 1: ");
        if(name1 == null) {
            StdOut.println("No common name");
        } else {
            StdOut.println(name1);
        }
        StdOut.println("Expected: No common name");

        StdOut.println();

        Comparable[][] names2 = generateArray2();
        String name2 = checkIfThereAreCommonNames(names2);

        StdOut.print("Check 2: ");
        if(name2 == null) {
            StdOut.println("No common name");
        } else {
            StdOut.println(name2);
        }
        StdOut.println("Expected: Rene");
    }
 
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:27,代码来源:Exercise21_Triplicates.java

示例10: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args){
    Exercise32_Steque<Integer> steque = new Exercise32_Steque<>();
    steque.push(1);
    steque.push(2);
    steque.push(3);
    steque.pop();
    steque.enqueue(5);
    steque.enqueue(6);

    StringJoiner stequeItems = new StringJoiner(" ");
    for (int number : steque) {
        stequeItems.add(String.valueOf(number));
    }

    StdOut.println("Steque items: " + stequeItems.toString());
    StdOut.println("Expected: 2 1 5 6");
}
 
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:18,代码来源:Exercise32_Steque.java

示例11: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {
    if (args.length != 3) {
        StdOut.println("Usage:\njava ResizeDemo [image filename] [num columns to remove] [num rows to remove]");
        return;
    }

    Picture picture = new Picture(args[0]);
    int removeColumns = Integer.parseInt(args[1]);
    int removeRows = Integer.parseInt(args[2]); 

    StdOut.printf("%d-by-%d image\n", picture.width(), picture.height());
    SeamCarver sc = new SeamCarver(picture);

    Stopwatch sw = new Stopwatch();

    for (int i = 0; i < removeRows; i++) {
        int[] horizontalSeam = sc.findHorizontalSeam();
        sc.removeHorizontalSeam(horizontalSeam);
    }

    for (int i = 0; i < removeColumns; i++) {
        int[] verticalSeam = sc.findVerticalSeam();
        sc.removeVerticalSeam(verticalSeam);
    }

    StdOut.printf("new image size is %d columns by %d rows\n", sc.width(), sc.height());

    StdOut.println("Resizing time: " + sw.elapsedTime() + " seconds.");
    picture.show();
    sc.picture().show();    
}
 
开发者ID:robotenique,项目名称:intermediateProgramming,代码行数:32,代码来源:ResizeDemo.java

示例12: use

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
/***************************************************************************
*  métodos privados
**************************************************************************/

// apenas para o uso do unit test abaixo
private static void use() {
    String message = "Use: java Tail [-n NUM] [FILE]\n" +
        "   Print the last 10 lines of each FILE to standard output.\n" +
        "   With more than one FILE, precede each with a header giving the file name.\n" +
        "   -n NUM: output the last NUM lines, instead of the last 10";
    StdOut.println(message);
}
 
开发者ID:robotenique,项目名称:intermediateProgramming,代码行数:13,代码来源:Tail.java

示例13: showUse

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
private static void showUse() {
    String msg = "Uso: meu_prompt> java MeuLinearProbingingHashST <alfa inf> <alfa sup> <nome arquivo>\n"
            + "    <alfa inf>: limite inferior para o comprimento médio das listas (= fator de carga)\n"
            + "    <alfa sup>: limite superior para o comprimento médio das listas (= fator de carga)\n"
            + "    <nome arquivo>: nome de um arquivo com um texto para que uma ST seja\n"
            + "                    criada com as palavras nesse texto.";
    StdOut.println(msg);
}
 
开发者ID:robotenique,项目名称:intermediateProgramming,代码行数:9,代码来源:MeuLinearProbingHashST.java

示例14: main

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
public static void main(String[] args) {

        // read the n points from a file
        In in = new In(args[0]);
        int n = in.readInt();
        Point[] points = new Point[n];
        for (int i = 0; i < n; i++) {
            int x = in.readInt();
            int y = in.readInt();
            points[i] = new Point(x, y);
        }

        // draw the points
        StdDraw.enableDoubleBuffering();
        StdDraw.setXscale(0, 32768);
        StdDraw.setYscale(0, 32768);
        for (Point p : points) {
            p.draw();
        }
        StdDraw.show();

        // print and draw the line segments
        BruteCollinearPoints collinear = new BruteCollinearPoints(points);
        for (LineSegment segment : collinear.segments()) {
            StdOut.println(segment);
            segment.draw();
        }
        StdDraw.show();
    }
 
开发者ID:SkullTech,项目名称:algorithms-princeton,代码行数:30,代码来源:BruteCollinearPoints.java

示例15: showUse

import edu.princeton.cs.algs4.StdOut; //导入方法依赖的package包/类
private static void showUse() {
    String msg = "Uso: meu_prompt> java MeuSeparateChainingHashST <alfa inf> <alfa sup> <nome arquivo>\n"
            + "    <alfa inf>: limite inferior para o comprimento médio das listas (= fator de carga)\n"
            + "    <alfa sup>: limite superior para o comprimento médio das listas (= fator de carga)\n"
            + "    <nome arquivo>: nome de um arquivo com um texto\n"
            + "          um ST será criada com as palavras do texto.";
    StdOut.println(msg);
}
 
开发者ID:robotenique,项目名称:intermediateProgramming,代码行数:9,代码来源:MeuSeparateChainingHashST.java


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