Basic Algorithm Scripting 基础算法脚本

Basic Algorithm Scripting

Convert Celsius to Fahrenheit

function convertToF(celsius) {
  let fahrenheit = celsius * 9/5 + 32;
  return fahrenheit;
}

convertToF(30);

Reverse a String

function reverseString(str) {
 str = str.split('').reverse().join('');
  return str;
}

reverseString("hello");

Factorialize a Number

function factorialize(num) {
  let factorial = 1;
  for ( let i = 1; i <= num; i++) {
    factorial *= i;
  }
  return factorial;
}

factorialize(5);

Find the Longest Word in a String

function findLongestWordLength(str) {
  let strArray = str.split(' ');
  let maxLength = 0;
  for (let i = 0; i < strArray.length; i++) {
      if (strArray[i].length > maxLength) {
        maxLength = strArray[i].length;
      }
  }
   return maxLength;
}
findLongestWordLength("The quick brown fox jumped over the lazy dog");

Return Largest Numbers in Arrays

function largestOfFour(arr) {
  // You can do this!
  let newArray = [];
  for (let i = 0; i < arr.length; i++) {
      let maxnum = arr[i][0];
    for (let j = 0; j < arr[i].length; j++) {
      if (arr[i][j] > maxnum) {
        maxnum = arr[i][j];
      }
    }
    newArray.push(maxnum);
  }
  return newArray;
}

largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);

Confirm the Ending

function confirmEnding(str, target) {
  // "Never give up and good luck will find you."
  // -- Falcor
  return str.slice(str.length - target.length) === target; 
}

confirmEnding("Bastian", "n");

Repeat a String Repeat a String

function repeatStringNumTimes(str, num) {
  // repeat after me
  let repeatResult = "";
  if (num > 0) {
    for (let i = num; i >0; i--) {
      repeatResult += str;
    }
  }
  return repeatResult;
}

repeatStringNumTimes("abc", 3);

Truncate a String

function truncateString(str, num) {
  // Clear out that junk in your trunk
  let newStr = str.split('');
   return newStr.length > num ? (newStr.slice(0, num).join('') + "...") : str;
}

truncateString("A-tisket a-tasket A green and yellow basket", 8);

Finders Keepers

function findElement(arr, func) {
  ;
  for (let i = 0; i < arr.length; i++) {
    if (arr[i] % 2 === 0) {
      return arr[i];
    }
  }
  return undefined;

}

findElement([1, 2, 3, 4], num => num % 2 === 0);

Boo who

function booWho(bool) {
  // What is the new fad diet for ghost developers? The Boolean.
  if (bool === true || bool ===false) {
    return true;
  }
  return false;
}

booWho(null);

Title Case a Sentence

function frankenSplice(arr1, arr2, n) {
  // It's alive. It's alive!
  let localArr2 = arr2.slice();
  for (let i = 1; i < arr1.length; i++) {
    localArr2.splice(n, 0, arr1[i]);
    n++;
  }
  return localArr2;
}

frankenSplice([1, 2, 3], [4, 5, 6], 1);

Falsy Bouncer

function bouncer(arr) {
  // Don't show a false ID to this bouncer.
 
  return arr.filter(Boolean);
}

bouncer([7, "ate", "", false, 9]);

Where do I Belong

function getIndexToIns(arr, num) {
  // Find my place in this sorted array.
  arr.sort(function(a, b) {
    return a - b;
  });

  for (var i = 0; i < arr.length; i++) {
    if (arr[i] >= num)
      return i;
  }

  return arr.length;
}

getIndexToIns([40, 60], 50);

Mutations

function mutation(arr) {
  var test = arr[0].toLowerCase();
  var target = arr[1].toLowerCase();
  for (var i = 0; i < target.length; i++) {
    if (test.indexOf(target[i]) < 0) {
      return false;
    }
    
  }
  return true;
}

mutation(["hello", "hey"]);

Chunky Monkey

function chunkArrayInGroups(arr, size) {
  // Break it up.
  var arr2 = [];
  for(var i = 0; i < arr.length; i+=size) {
    arr2.push(arr.slice(i,i+size));
  }
  return arr2;
}

chunkArrayInGroups(["a", "b", "c", "d"], 2);
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值