本文整理汇总了Java中edu.princeton.cs.algs4.StdOut类的典型用法代码示例。如果您正苦于以下问题:Java StdOut类的具体用法?Java StdOut怎么用?Java StdOut使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
StdOut类属于edu.princeton.cs.algs4包,在下文中一共展示了StdOut类的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: main
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);
}
}
开发者ID:DCMMC,项目名称:Java-Algorithms-Learning,代码行数:24,代码来源:Permutation.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: printSeam
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();
}
开发者ID:Lxinyuelxy,项目名称:Princeton_Algorithms,代码行数:22,代码来源:PrintSeams.java
示例5: 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
示例6: 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
示例7: 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
示例8: 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());
}
开发者ID:robotenique,项目名称:intermediateProgramming,代码行数:18,代码来源:Board.java
示例9: main
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);
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:18,代码来源:Exercise42_ProblemSizes.java
示例10: printShortestPathsTree
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);
}
}
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:17,代码来源:Exercise45_FastBellmanFord.java
示例11: main
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");
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:19,代码来源:Exercise26_LRUCache.java
示例12: main
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");
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:25,代码来源:Exercise20_BitonicSearch_2lgN.java
示例13: main
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();
}
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:18,代码来源:Exercise25_DoublingTestRandomGrids.java
示例14: testPopRight
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");
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:20,代码来源:Exercise33_2_Deque.java
示例15: main
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);
}
}
开发者ID:yunfeiguo,项目名称:bioinfo_toolbox,代码行数:19,代码来源:Date.java
示例16: doExperiment
import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private void doExperiment() {
LookupCSV lookupCSV = new LookupCSV();
int[] numberOfQueries = {100000, 1000000, 10000000, 100000000, 1000000000};
String[] filePaths = {LARGE_INPUT_FILE_PATH1, LARGE_INPUT_FILE_PATH2};
String[] fileNames = {"surnames.csv", "sdss174052.csv"};
StdOut.printf("%18s %20s %10s\n", "Large input | ", "Number of queries | ", "Time spent");
for(int i = 0; i < numberOfQueries.length; i++) {
for(int j = 0; j < filePaths.length; j++) {
In in = new In(filePaths[j]);
String line = in.readLine();
String[] tokens = line.split(",");
int randomKeyIndex = StdRandom.uniform(tokens.length);
int randomValueIndex = StdRandom.uniform(tokens.length);
Stopwatch stopwatch = new Stopwatch();
lookupCSV.lookup(filePaths[j], randomKeyIndex, randomValueIndex, numberOfQueries[i]);
double timeSpent = stopwatch.elapsedTime();
printResults(fileNames[j], numberOfQueries[i], timeSpent);
}
}
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:27,代码来源:Exercise32_Dictionary.java
示例17: timeRandomInput
import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private static double timeRandomInput(SortTypes sortType, int initialLength, int numberOfExperiments) {
double total = 0;
int length = initialLength;
for(int experiment = 0; experiment < numberOfExperiments; experiment++) {
Comparable[] array1 = createArrayWithAnyValues(length);
Comparable[] array2 = createArrayWith2Values(length);
double timeForArrayWithAnyValues = time(sortType, array1);
double timeForArrayWith2Values = time(sortType, array2);
StdOut.printf("For an array of size %d: \n", length);
StdOut.printf("Time for an array with any values: %.1f \n", timeForArrayWithAnyValues);
StdOut.printf("Time for an array with 2 values: %.1f \n", timeForArrayWith2Values);
StdOut.println();
total += time(sortType, array2);
length *= 2;
}
return total;
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:24,代码来源:Exercise28_EqualKeys.java
示例18: doExperiment
import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private static void doExperiment(Map<Integer, Comparable[]> allInputArrays) {
StdOut.printf("%13s %25s %20s\n", "Array Size | ","Number of Compares Std Impl | ", "Number of Compares Floyd Enhancement");
for(int i=0; i < 3; i++) {
Comparable[] originalArray = allInputArrays.get(i);
Comparable[] array = new Comparable[originalArray.length];
System.arraycopy(originalArray, 0, array, 0, originalArray.length);
numberOfCompares = 0;
//Standard implementation
heapSort(originalArray, false);
long numberOfComparesStandardImpl = numberOfCompares;
numberOfCompares = 0;
//Using Floyd's sink-to-the-bottom-and-then-swim idea
heapSort(array, true);
printResults(originalArray.length, numberOfComparesStandardImpl, numberOfCompares);
}
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:22,代码来源:Exercise40_FloydsMethod.java
示例19: main
import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
public static void main(String[] args) {
Comparable[] array1 = generateArray1();
int[] indexSortedArray1 = indexSort(array1);
int[] expectedIndexSortedArray1 = {5, 4, 6, 3, 7, 2, 8, 1, 9, 0};
if (validate(expectedIndexSortedArray1, indexSortedArray1)) {
StdOut.println("Index sorted OK");
} else {
StdOut.println("Index sorted NOT OK");
}
Comparable[] array2 = generateArray2();
int[] indexSortedArray2 = indexSort(array2);
int[] expectedIndexSortedArray2 = {3, 2, 1, 0};
if (validate(expectedIndexSortedArray2, indexSortedArray2)) {
StdOut.println("Index sorted OK");
} else {
StdOut.println("Index sorted NOT OK");
}
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:23,代码来源:Exercise20_IndexSort.java
示例20: doExperiment
import edu.princeton.cs.algs4.StdOut; //导入依赖的package包/类
private void doExperiment(Map<Integer, Comparable[]> allInputArrays) {
StdOut.printf("%13s %25s %20s\n", "Array Size | ","Number of Compares Level Order | ", "Number of Compares Pre Order");
for(int i=0; i < 3; i++) {
Comparable[] originalArray = allInputArrays.get(i);
Comparable[] array = new Comparable[originalArray.length];
System.arraycopy(originalArray, 0, array, 0, originalArray.length);
numberOfCompares = 0;
//Standard implementation - heap-ordered tree in level order
heapSort(originalArray, null, HeapType.LEVEL_ORDER);
long numberOfComparesStandardImpl = numberOfCompares;
numberOfCompares = 0;
preorderTraversalIndicesIndex = 1;
//Using a heap-ordered tree in preorder
int[] preorderTraversalIndices = new int[array.length];
generatePreorderTraversalIndices(preorderTraversalIndices, 1, array.length);
heapSort(array, preorderTraversalIndices, HeapType.PRE_ORDER);
printResults(originalArray.length, numberOfComparesStandardImpl, numberOfCompares);
}
}
开发者ID:reneargento,项目名称:algorithms-sedgewick-wayne,代码行数:25,代码来源:Exercise42_PreorderHeaps.java
注:本文中的edu.princeton.cs.algs4.StdOut类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论