Java StdOut类代码示例

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
/**
*  client program
*  takes a command-line integer k; reads in a sequence of strings from standard input using StdIn.
* readString(); and prints exactly k of them, uniformly at random. Print each item from the sequence at most once.
*/
public static void main(String[] args) {
	int k = Integer.parseInt(args[0]);

	RandomizedQueue<String> queue = new RandomizedQueue<>();
	
	while (!StdIn.isEmpty()) {
		queue.enqueue(StdIn.readString());
	}

	int cnt = -1;

	for (String s : queue) {
		if (++cnt == k)
			break;

		StdOut.println(s);
	}
}
 

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);
        }
    }
 

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);
        }*/
    }
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private static void printSeam(SeamCarver carver, int[] seam, boolean direction) {
    double totalSeamEnergy = 0.0;

    for (int row = 0; row < carver.height(); row++) {
        for (int col = 0; col < carver.width(); col++) {
            double energy = carver.energy(col, row);
            String marker = " ";
            if ((direction == HORIZONTAL && row == seam[col]) ||
                (direction == VERTICAL   && col == seam[row])) {
                marker = "*";
                totalSeamEnergy += energy;
            }
            StdOut.printf("%7.2f%s ", energy, marker);
        }
        StdOut.println();
    }                
    // StdOut.println();
    StdOut.printf("Total energy = %f\n", totalSeamEnergy);
    StdOut.println();
    StdOut.println();
}
 

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);

}
 

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());
        }
    }
 

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());
    }

}
 

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());
}
 

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

    //TwoSumFast
    StdOut.println("TwoSumFast");
    runExperiments(1);

    //ThreeSum
    StdOut.println("ThreeSum");
    runExperiments(2);

    //ThreeSumFast
    StdOut.println("ThreeSumFast");
    runExperiments(3);
}
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private void printShortestPathsTree(EdgeWeightedDigraph edgeWeightedDigraph,
                                    BellmanFordSPBoundedIntegerWeights bellmanFordSPBoundedIntegerWeights,
                                    int source) {
    for (int vertex = 0; vertex < edgeWeightedDigraph.vertices(); vertex++) {
        if (bellmanFordSPBoundedIntegerWeights.hasPathTo(vertex)) {
            StdOut.printf("%d to %d (%d)  ", source, vertex, bellmanFordSPBoundedIntegerWeights.distTo(vertex));

            for (DirectedEdge edge : bellmanFordSPBoundedIntegerWeights.pathTo(vertex)) {
                StdOut.print(edge + "   ");
            }
            StdOut.println();
        } else {
            StdOut.printf("%d to %d         no path\n", source, vertex);
        }
    }
}
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
public static void main(String[] args) {
    Exercise26_LRUCache exercise26_lruCache = new Exercise26_LRUCache();
    LRUCache<Integer> lruCache = exercise26_lruCache.new LRUCache<>();

    lruCache.access(1);
    lruCache.access(2);
    lruCache.access(3);
    lruCache.access(4);
    lruCache.access(5);

    StdOut.println("Size: " + lruCache.size() + " Expected: 5");
    StdOut.println("Least recently accessed item: " + lruCache.remove() + " Expected: 1");
    StdOut.println("Least recently accessed item: " + lruCache.remove() + " Expected: 2");

    lruCache.access(3);
    StdOut.println("Least recently accessed item: " + lruCache.remove() + " Expected: 4");
    StdOut.println("Size: " + lruCache.size() + " Expected: 2");
}
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
public static void main(String[] args){
    int[] array1 = {1, 2, 3, 4, -1, -2, -3};
    int[] array2 = {1, 5, 4, 3, 2, 0};
    int[] array3 = {2, 4, 8, 16, 32, 1};
    int[] array4 = {2, 4, 8, 16, 32};
    int[] array5 = {2, 1};
    int[] array6 = {9};

    int indexOfElement1 = bitonicSearch(array1, -1);
    int indexOfElement2 = bitonicSearch(array2, 5);
    int indexOfElement3 = bitonicSearch(array3, 2);
    int indexOfElement4 = bitonicSearch(array3, 99);
    int indexOfElement5 = bitonicSearch(array4, 32);
    int indexOfElement6 = bitonicSearch(array5, 1);
    int indexOfElement7 = bitonicSearch(array6, 9);

    StdOut.println("Index of element: " + indexOfElement1 + " Expected: 4");
    StdOut.println("Index of element: " + indexOfElement2 + " Expected: 1");
    StdOut.println("Index of element: " + indexOfElement3 + " Expected: 0");
    StdOut.println("Index of element: " + indexOfElement4 + " Expected: -1");
    StdOut.println("Index of element: " + indexOfElement5 + " Expected: 4");
    StdOut.println("Index of element: " + indexOfElement6 + " Expected: 1");
    StdOut.println("Index of element: " + indexOfElement7 + " Expected: 0");
}
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
public static void main(String[] args) {
    int numberOfExperiments = Integer.parseInt(args[0]);

    Exercise25_DoublingTestRandomGrids doublingTestRandomGrids = new Exercise25_DoublingTestRandomGrids();

    for(int i = 1; i <= 3; i++) {

        switch (i) {
            case 1: StdOut.println("Quick Find"); break;
            case 2: StdOut.println("Quick Union"); break;
            case 3: StdOut.println("Weighted Quick Union");  break;
        }

        doublingTestRandomGrids.doExperiments(numberOfExperiments, i);
        StdOut.println();
    }
}
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private void testPopRight() {
    StdOut.println("\nTest Pop Right");

    Exercise33_2_Deque<String> deque = new Exercise33_2_Deque<>();
    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("Deque items: " + dequeItems.toString());
    StdOut.println("Expected: a");
}
 

import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
public static void main(String[] args) {
    Date today = new Date(2, 25, 2004); //test constructor
    StdOut.println(today); //test toString?
    for (int i = 0; i < 10; i++) {
        today = today.next();
        System.out.println(today);
    }
    StdOut.println(today.isAfter(today.next()));
    StdOut.println(today.isAfter(today));
    StdOut.println(today.next().isAfter(today));
    
    Date birthday = new Date("10/16/1971");
    StdOut.println(birthday);
    for (int i = 0; i < 10; i++) {
        birthday = birthday.next();
        StdOut.println(birthday);
    }
}