tower of hanoi - Node.js Algorithm

Node.js examples for Algorithm:Tower of Hanoi

  1. HOME
  2. Node.js
  3. Algorithm
  4. Tower of Hanoi

Description

tower of hanoi

Demo Code


var MyQueue = function() {
  this.stack_en = [];/*from   w  w w  .  j  a va2  s. c o m*/
  this.stack_de = [];
};

MyQueue.prototype.enqueue = function(val) {
  if (this.stack_de.length>0) {
    while(this.stack_de.length>0) {
      this.stack_en.push(this.stack_de.pop());
    }
  }
  this.stack_en.push(val);
};
MyQueue.prototype.dequeue = function() {
  while(this.stack_en.length>0) {
    this.stack_de.push(this.stack_en.pop());
  }
  return this.stack_de.pop();
};

var myQueue = new MyQueue();
myQueue.enqueue(1);
myQueue.enqueue(1);
myQueue.dequeue();
myQueue.enqueue(2);
myQueue.enqueue(2);
myQueue.dequeue();
myQueue.enqueue(3);
console.log(myQueue.dequeue(),myQueue.dequeue(),myQueue.dequeue(),myQueue.dequeue());

// Stack having min value

var MinStack = function() {
  this.vals = [];
  this.mins = [];
};
MinStack.prototype.push = function(val) {
  if (this.mins.length==0 || val<=this.mins[this.mins.length-1]) {
    this.mins.push(val);
  }
  this.vals.push(val);
};
MinStack.prototype.pop = function() {
  var val = this.vals.pop();
  if (val==this.mins[this.mins.length-1]) {
    this.mins.pop();
  }
  return val;
};
MinStack.prototype.min = function() {
  return this.mins[this.mins.length-1];
};

var minStack = new MinStack();
minStack.push(10);
minStack.push(5);
minStack.push(3);
minStack.push(3);
minStack.pop();
console.log(minStack.min());


var tower_of_hanoi = function() {
  var start = [4,3,2,1], buffer=[], target = [];
  function move(n, src, dest, buf) {
    if (n<1) return;
    move(n-1, src, buf, dest);
    dest.push(src.pop());
    console.log(start,buffer,target);
    move(n-1, buf, dest, src);
  }
  move(start.length, start, target, buffer);
};

tower_of_hanoi();


var sort_stack = function(stack) {
  var val, target = [];
  while (stack.length>0) {
    val = stack.pop();
    while (target.length>0 && target[target.length-1]>val) {
      stack.push(target.pop());
    }
    target.push(val);
  }
  return target;
};

console.log(sort_stack([2,4,1,5,3]));

Related Tutorials