Clone repo:
git clone git://github.com/maccman/juggernaut.git
cd juggernaut
Create Heroku app:
heroku create myapp --stack cedar
heroku addons:add redistogo:nano
git push heroku master
Clone repo:
git clone git://github.com/maccman/juggernaut.git
cd juggernaut
Create Heroku app:
heroku create myapp --stack cedar
heroku addons:add redistogo:nano
git push heroku master
| if (typeof Object.create !== "function") | |
| Object.create = function(o) { | |
| function F() {} | |
| F.prototype = o; | |
| return new F(); | |
| }; | |
| var Model = { | |
| init: function(){ }, | |
| <script id="userTmpl" type="text/x-jquery-tmpl"> | |
| <li>${name}</li> | |
| </script> | |
| <ul id="users"> </ul> |
| <ul id="members" data-role="listview" data-filter="true"> | |
| <!-- ... more list items ... --> | |
| <li> | |
| <a href="detail.html?id=10"> | |
| <h3>John Resig</h3> | |
| <p><strong>jQuery Core Lead</strong></p> | |
| <p>Boston, United States</p> | |
| </a> | |
| </li> | |
| <!-- ... more list items ... --> |
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE | |
| Version 2, December 2004 | |
| Copyright (C) 2011 Eli Perelman http://eliperelman.com | |
| Everyone is permitted to copy and distribute verbatim or modified | |
| copies of this license document, and changing it is allowed as long | |
| as the name is changed. | |
| DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE |
| if ( !Object.prototype.hasOwnProperty ) { | |
| Object.prototype.hasOwnProperty = function(prop) { | |
| var proto = obj.__proto__ || obj.constructor.prototype; | |
| return (prop in this) && (!(prop in proto) || proto[prop] !== this[prop]); | |
| }; | |
| } |
| var cached = {}; | |
| function factorial(num) { | |
| if (num === 1) | |
| return 1; | |
| else if (cached[num] !== undefined) { | |
| return cached[num]; | |
| } | |
| else { | |
| return num * factorial(num - 1); | |
| } |
| /* | |
| Stamp Vending Machine | |
| It is for dispensing the minimum stamps based on the available stamps in the machine. | |
| How to use: | |
| 1. Compile: javac StampVendingMachine.java | |
| 2. Run: java StampVendingMachine | |
| 3. > 32 | |
| output: 2 | |
| ctrl + c to terminate |
| public class Solution { | |
| public boolean isPalindrome(String s) { | |
| // Start typing your Java solution below | |
| // DO NOT write main() function | |
| int size = s.length(); | |
| String lcs = s.toLowerCase(); | |
| int left = 0; | |
| int right = size - 1; | |
| while(right >= left) { | |
| if(lcs.charAt(right) == lcs.charAt(left)) { |
| /* | |
| For example, given the following triangle | |
| [ | |
| [2], | |
| [3,4], | |
| [6,5,7], | |
| [4,1,8,3] | |
| ] | |
| The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11). |