Skip to content
This repository was archived by the owner on Mar 26, 2022. It is now read-only.
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions .gitignore
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
/node_modules
/.idea
19 changes: 15 additions & 4 deletions bot.js
Original file line number Diff line number Diff line change
Expand Up @@ -171,7 +171,7 @@ controller.hears(['uptime','identify yourself','who are you','what is your name'

controller.hears(['fibonacci'], 'direct_message,direct_mention,mention', function(bot, message) {
if (message.text === 'fibonacci') {
bot.reply(message, '1, 1, 2, 3, 5, 8, 13, 21, 34, 55');
bot.reply(message, '1, 1, 2, 3, 5');
}
});

Expand All @@ -184,17 +184,28 @@ controller.hears(['fibonacci ([0-9]+)'], 'direct_message,direct_mention,mention'
bot.reply(message, 'That is not a Fibonacci number!');
}
else {
bot.reply(message, fibonacci.slice(fibonacci.length-10,fibonacci.length).join(', '));
var a = fibonacci[fibonacci.length-1];
var b;
if(fibonacci.length>1){
b=fibonacci[fibonacci.length-2];
}else{
b=0;
}
var nextFive = [];
for(var i = 0; i<5; i++){
nextFive.push(a+b);
b = a;
a = nextFive[i];
}
bot.reply(message, nextFive.slice(0,nextFive.length).join(', '));
}
});

function calculateFibonacciUpto(goal) {
var fibonacci = [1, 1];

while (fibonacci[fibonacci.length-1] < goal) {
fibonacci.push(fibonacci[fibonacci.length-2] + fibonacci[fibonacci.length-1]);
}

return fibonacci;
}

Expand Down