brazilcoder
BAN USERIn Node.js
var intArray = [1,2,3];
var int = Number(intArray.join(""));
int++;
int = int + "";
console.log(int.split(""));
in Node.js:
var relPath = "\\a\\b\\..\\foo.txt";
var tokens = relPath.split("\\");
while (tokens.length > 0) {
var folder = tokens.shift();
if (folder.length == 0) continue; // ignores blank
if (tokens[0] == "..") {
tokens.shift();
continue;
}
process.stdout.write("\\" + folder);
}
// \a\foo.txt
Example in Node.js:
var out = [];
var n = 5;
var result = 0
function combine(start) {
if (out.length == n) {
console.log(out.join(""));
result++;
return;
}
for (var i = 1; i < 10; i++) {
if (Math.abs(out[out.length-1]-i)<4)
continue;
out.push(i);
combine(i+1);
out.pop();
}
}
combine(0);
console.log("Number of possibilities for n = 5: " + result); // 1454
var s = "This is an example";
var words = s.split(" ");
for (var i = 0; i < words.length; i++) {
var letters = words[i].split("");
while (letters.length > 0)
process.stdout.write(letters.pop());
process.stdout.write(" ");
}
var n = 6;
var k = 7;
var M = [
[1, 0, 0, 0, 1, 0, 0],
[1, 0, 0, 0, 0, 1, 0],
[1, 0, 0, 0, 0, 0, 1],
[0, 1, 0, 0, 1, 0, 0],
[0, 0, 1, 0, 0, 1, 0],
[0, 0, 0, 1, 0, 0, 1]
];
console.log("Starting");
function isSufficient(dishes) {
for (var p = 0; p < n; p++) {
var numDishes = 0;
for (var d = 0; d < dishes.length; d++) {
numDishes += M[p][dishes[d]];
}
if (numDishes < 1)
return false;
}
return true;
}
var minD = 99999;
var out = [];
function minDishes() {
combine(0);
return minD;
}
function combine(start) {
if (start == k) return;
for (var i = start; i < k; i++) {
out.push(i);
if (isSufficient(out) && minD > out.length) {
minD = out.length;
console.log(out + " minDishes: "+ minD);
}
combine(i+1);
out.pop();
}
}
console.log("minDishes: "+minDishes());
In Node.js (without parsing to int):
- brazilcoder August 03, 2015