+/EE360C

algorithms

git clone https://git.julia.blue/+/EE360C

Joseph RyanAdd O(n^3) solution for lab 3144de5e

master
1.1 KiB37 linesraw
1import java.io.File;
2import java.io.FileNotFoundException;
3import java.util.Scanner;
4
5public class Driver3 {
6    public static int[] cities;
7
8    public static void main(String[] args) throws FileNotFoundException {
9        parseArgs(args);
10        testRun(cities);
11    }
12
13    public static void parseArgs(String[] args) throws FileNotFoundException {
14        Scanner sc = new Scanner(new File(args[0]));
15
16        // the input should only be one continuous line of values, separated by
17        // spaces
18        String[] line = sc.nextLine().split(" ");
19        cities = new int[line.length];
20        sc.close();
21
22        for (int i = 0; i < line.length; i++) {
23            cities[i] = Integer.parseInt(line[i]);
24        }
25    }
26
27    public static void testRun(int[] cities) {
28        Program3 pa3 = new Program3();
29
30        long start = System.currentTimeMillis();
31        int opt = pa3.maxCoinValue(cities);
32        long end = System.currentTimeMillis();
33
34        System.out.println("Optimal amount of coins: " + opt);
35        System.out.println("Completed in " + (end - start) + " milliseconds");
36    }
37}