lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fixed formatting problems

Browse Source
This commit is contained in:
Alexandrshy
2019-07-26 00:29:41 +04:00
parent bac32b613b
commit 5a1d2c04d4
2 changed files with 21 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
08_greedy_algorithms/ES6/01_set_covering.js
View File

@@ -1,20 +1,19 @@
// You pass an array in, and it gets converted to a set.
let statesNeeded = new Set(['mt', 'wa', 'or', 'id', 'nv', 'ut', 'ca', 'az']);
let statesNeeded = new Set(["mt", "wa", "or", "id", "nv", "ut", "ca", "az"]);
const stations = {};
stations.kone = new Set(['id', 'nv', 'ut']);
stations.ktwo = new Set(['wa', 'id', 'mt']);
stations.kthree = new Set(['or', 'nv', 'ca']);
stations.kfour = new Set(['nv', 'ut']);
stations.kfive = new Set(['ca', 'az']);
stations.kone = new Set(["id", "nv", "ut"]);
stations.ktwo = new Set(["wa", "id", "mt"]);
stations.kthree = new Set(["or", "nv", "ca"]);
stations.kfour = new Set(["nv", "ut"]);
stations.kfive = new Set(["ca", "az"]);
const finalStations = new Set();
while (statesNeeded.size) {
let bestStation = null;
let statesCovered = new Set();
Object.keys(stations).forEach((station) => {
Object.keys(stations).forEach(station => {
const states = stations[station];
const covered = new Set([...statesNeeded].filter(x => states.has(x)));
if (covered.size > statesCovered.size) {

29
08_greedy_algorithms/javascript/01_set_covering.js
View File

@@ -1,7 +1,7 @@
'use strict';
"use strict";
// You pass an array in, and it gets converted to a set.
let states_needed = new Set(["mt", "wa", "or", "id", "nv", "ut", "ca", "az"]);
let statesNeeded = new Set(["mt", "wa", "or", "id", "nv", "ut", "ca", "az"]);
const stations = {};
stations["kone"] = new Set(["id", "nv", "ut"]);
@@ -10,22 +10,21 @@ stations["kthree"] = new Set(["or", "nv", "ca"]);
stations["kfour"] = new Set(["nv", "ut"]);
stations["kfive"] = new Set(["ca", "az"]);
const final_stations = new Set();
const finalStations = new Set();
while (states_needed.size) {
let best_station = null;
let states_covered = new Set();
while (statesNeeded.size) {
let bestStation = null;
let statesCovered = new Set();
for (let station in stations) {
let states = stations[station];
let covered = new Set([...states_needed].filter((x) => states.has(x)));
if (covered.size > states_covered.size) {
best_station = station;
states_covered = covered;
const states = stations[station];
const covered = new Set([...statesNeeded].filter(x => states.has(x)));
if (covered.size > statesCovered.size) {
bestStation = station;
statesCovered = covered;
}
}
states_needed = new Set([...states_needed].filter((x) => !states_covered.has(x)));
final_stations.add(best_station);
statesNeeded = new Set([...statesNeeded].filter(x => !statesCovered.has(x)));
finalStations.add(bestStation);
}
console.log(final_stations); // Set { 'kone', 'ktwo', 'kthree', 'kfive' }
console.log(finalStations); // Set { 'kone', 'ktwo', 'kthree', 'kfive' }