爱钓鱼的程序猿

function isBoolean(obj){ if(obj){ console.log(obj); return obj; }}function bouncer(arr) { var filterArray = arr.filter(isBoolean); console.log(filterArray); retu

function where(collection, source) { var arr = []; // What's in a name? arr = collection.filter(function(x){ var tmpAll = true; for(var prop in source) { if

function allCaps(text){ for(var i=0;i<text.length;i++){ var c=text.charAt(i); if(c<'A' || c>'Z') return false; } return true;}function myReplace(str, before, af

function pairArr(str){ switch (str) { case "A": { return ['A','T']; } case "T": { return ['T','A']; } case "C":

function diff(arr1, arr2) { // Same, same; but different. var newArr = []; newArr = arr1.filter(function(x){ if(arr2.indexOf(x) == -1) { return x; }

function Arabit2Roman(arabic){ var alpha = [ 'I', 'V', 'X', 'L', 'C', 'D', 'M' ]; var roman=""; var bit = 0; while (arabic > 0) { var tempnum = arabic % 10; switch (

function fearNotLetter(str) { var tmpArray = str.split(""); var firstObjc = tmpArray[0].charCodeAt(); var lastObjc =tmpArray[tmpArray.length -1].charCodeAt(); if(lastObjc - firstObjc+ 1

function boo(bool) { // What is the new fad diet for ghost developers? The Boolean. //console.log(typeof(bool)); if(typeof(bool) === "boolean") { console.log(bool); retu

function translate(str) { str=str.toLowerCase(); var n =str.search(/[aeiuo]/); switch (n){ case 0: str = str+"way"; break; case -1: str = str+"ay"; break; default :

function truncate(str, num) { // Clear out that junk in your trunk var tmpStr = ""; if(str.length<=num) { return str; }else if(num >=3) { tmpStr = str.slice(0,num-3)

function mutation(arr) { var firstString = arr[0].toLowerCase(); var secondString = arr[1].toLowerCase(); var secondArray = secondString.split(""); var isTrue = true; secondArray.map

function where(arr, num) { // Find my place in this sorted array.f var tmpIndex = 0; var tmpArr = arr.sort(function(a,b){return a>b?1:-1;}); console.log(tmpArr); for(var i =0; i<tmp

function findLongestWord(str) { var beginArray = str.split(" "); console.log(beginArray); var length = 0; beginArray.map(function(x){ if(length < x.length) {

function titleCase(str) { var splitArray = str.split(" "); var upArray = splitArray.map(function(x){ var tmpArray = x.toLowerCase().split(""); tmpArray[0] = tmpArray[0].toUppe

function destroyer() { // Remove all the values console.log(arguments); var args = Array.prototype.slice.call(arguments,0); console.log(args); var firstArray = []; firstArray =

function palindrome(str) { // Good luck! var pattern = new RegExp("[`~!@#$^&*%()=|{}':;',\\[\\].<>/?~！@#￥……&*（）&;|{}【】‘；：”“'。，、？ _-]"); var rs = ""; for (var i = 0; i < str.length; i++)

function largestOfFour(arr) { // You can do this! var outPutArray = arr.map(function(x){ var tmpArray = x; var tmp = 0; tmpArray.map(function (tmpX) { if(tmp

function chunk(arr, size) { // Break it up. var tmpArray = []; if(size<arr.length) { for (var i =0;i<arr.length ;i=size+i) { if(i+size>arr.length-1)

function slasher(arr, howMany) { // it doesn't always pay to be first var tmpArray = []; if(arr.length <howMany) { return []; }else { tmpArray = arr.splice(howMa

function unite(arr1, arr2, arr3) { var arr = []; var resultArr = []; for(var i = 0; i <arguments.length;i++) { arr.push(arguments[i]); } console.log(arr); //arr.concat(