codewars练习记录23 js

文章包含了多个编程挑战的解决方案,包括将文本替换特定字符、计算数组中最大数的乘积、移除句子末尾的感叹号、创建curry函数以乘以数组元素以及实现指数运算。这些示例展示了字符串操作、数组处理和函数设计的技巧。
摘要由CSDN通过智能技术生成

[8 kyu] Contamination #1 -String-

An AI has infected a text with a character!!
This text is now fully mutated to this character.
If the text or the character are empty, return an empty string.
There will never be a case when both are empty as nothing is going on!!
Note: The character is a string of length 1 or an empty string.
Example

text before = “abc”
character = “z”
text after = “zzz”

翻译:
一个AI感染了带有字符的文本!!
此文本现在已完全变异为此字符。
如果文本或字符为空,则返回空字符串。
永远不会有两个都空着的情况,因为什么都没有发生!!
注意:该字符是长度为1的字符串或空字符串。
解:

function contamination(text, char){
  return char.repeat(text.length)
}
[7 kyu] Product Of Maximums Of Array (Array Series #2)

Task
Given an array/list [] of integers , Find the product of the k maximal numbers.
Notes
Array/list size is at least 3 .
Array/list’s numbers Will be mixture of positives , negatives and zeros
Repetition of numbers in the array/list could occur.
翻译:
给定整数数组/列表[],求k个最大数的乘积。
笔记
数组/列表大小至少为3。
数组/列表的数字将是正数、负数和零的混合
数组/列表中的数字可能会重复。
解一:

function maxProduct(numbers, size){
  let arr = numbers.sort((a, b) => b - a)
  let max = 1
  for (let i = 0; i < size; i++) {
    max = max * arr[i]
  }
  return max
}

解二:

function maxProduct(numbers, size){
  return numbers.sort((a, b) => b - a).slice(0, size).reduce((a, b) => a * b);
}
[8 kyu] Exclamation marks series #2: Remove all exclamation marks from the end of sentence

Remove all exclamation marks from the end of sentence.

Examples

remove(“Hi!”) === “Hi”
remove(“Hi!!!”) === “Hi”
remove(“!Hi”) === “!Hi”
remove(“!Hi!”) === “!Hi”
remove(“Hi! Hi!”) === “Hi! Hi”
remove(“Hi”) === “Hi”

翻译:
删除句末的所有感叹号。
解一:

function remove (string) {  
var i = string.length - 1;
while(string[i] == "!"){
   i--;
}
return string.substring(0,i+1);
  }

解二:

function remove(s){
  return s.replace(/!+$/, '');
}
[7 kyu] Currying functions: multiply all elements in an array

To complete this Kata you need to make a function multiplyAll/multiply_all which takes an array of integers as an argument. This function must return another function, which takes a single integer as an argument and returns a new array.
The returned array should consist of each of the elements from the first array multiplied by the integer.
Example:

multiplyAll([1, 2, 3])(2) = [2, 4, 6];

翻译:
要完成这个Kata,您需要创建一个函数multiplyAll/multiply_all,它以整数数组为参数。此函数必须返回另一个函数,该函数将单个整数作为参数并返回一个新数组。
返回的数组应该由第一个数组中的每个元素乘以整数组成。
解:

function multiplyAll(arr) {
  return function(n) {
    return arr.map(x => x * n);
  }
}
[8 kyu] Power

The goal is to create a function ‘numberToPower(number, power)’ that “raises” the number up to power (ie multiplies number by itself power times).
Examples

numberToPower(3,2) // -> 9 ( = 3 * 3 )
numberToPower(2,3) // -> 8 ( = 2 * 2 * 2 )
numberToPower(10,6) // -> 1000000

Note: Math.pow and some other Math functions like eval() and ** are disabled.
翻译:
目标是创建一个函数“numberToPower(number,power)”,将数字“提升”到幂(即将数字乘以自身的幂次)。
注:不能使用Math.pow和其他一些数学函数,如eval()和 **
解:

function numberToPower(number, power){
  var total = 1;
  for (var i = 1; i <= power; i++) { 
    total = total * number;
  }
  return total;
}
[7 kyu] Odd-Even String Sort

Given a string s. You have to return another string such that even-indexed and odd-indexed characters of s are grouped and groups are space-separated (see sample below)
Note:

0 is considered to be an even index.
All input strings are valid with no spaces
input: ‘CodeWars’
output ‘CdWr oeas’

S[0] = ‘C’
S[1] = ‘o’
S[2] = ‘d’
S[3] = ‘e’
S[4] = ‘W’
S[5] = ‘a’
S[6] = ‘r’
S[7] = ‘s’

Even indices 0, 2, 4, 6, so we have ‘CdWr’ as the first group
odd ones are 1, 3, 5, 7, so the second group is ‘oeas’
And the final string to return is ‘Cdwr oeas’
翻译:
给定一个字符串s,您必须返回另一个字符串,以便对s的偶数索引字符和奇数索引字符进行分组,并对组进行空格分隔。
解:

const sortMyString = s => {
    let even = s.split('').filter((v, i) => i % 2 == 0).join('')
    let odd = s.split('').filter((v, i) => i % 2 != 0).join('')
    return even + ' ' + odd
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值